/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5000 --traceabstraction.additional.smt.options interpolation-heuristic=SMALLESTAMONGWIDE --traceabstraction.additional.smt.options tolerance=0.2 --traceabstraction.additional.smt.options log-additional-information=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-177f698 [2020-08-22 03:48:43,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 03:48:43,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 03:48:43,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 03:48:43,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 03:48:43,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 03:48:43,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 03:48:43,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 03:48:43,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 03:48:43,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 03:48:43,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 03:48:43,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 03:48:43,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 03:48:43,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 03:48:43,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 03:48:43,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 03:48:43,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 03:48:43,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 03:48:43,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 03:48:43,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 03:48:43,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 03:48:43,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 03:48:43,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 03:48:43,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 03:48:43,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 03:48:43,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 03:48:43,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 03:48:43,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 03:48:43,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 03:48:43,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 03:48:43,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 03:48:43,357 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 03:48:43,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 03:48:43,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 03:48:43,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 03:48:43,360 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 03:48:43,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 03:48:43,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 03:48:43,361 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 03:48:43,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 03:48:43,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 03:48:43,364 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-22 03:48:43,386 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 03:48:43,386 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 03:48:43,387 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-22 03:48:43,388 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-22 03:48:43,388 INFO L138 SettingsManager]: * Use SBE=true [2020-08-22 03:48:43,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 03:48:43,388 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 03:48:43,389 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 03:48:43,389 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 03:48:43,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 03:48:43,389 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 03:48:43,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 03:48:43,390 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 03:48:43,390 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 03:48:43,390 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 03:48:43,390 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 03:48:43,390 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 03:48:43,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 03:48:43,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-22 03:48:43,391 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 03:48:43,391 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 03:48:43,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 03:48:43,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 03:48:43,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-22 03:48:43,392 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-22 03:48:43,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-22 03:48:43,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-22 03:48:43,393 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 03:48:43,393 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-22 03:48:43,393 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.2;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.2;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.2;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=SMALLESTAMONGWIDE;tolerance=0.2;log-additional-information=true; [2020-08-22 03:48:43,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 03:48:43,762 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 03:48:43,766 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 03:48:43,768 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 03:48:43,768 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 03:48:43,769 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-22 03:48:43,837 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/86d32713a/8d8d9f49f9b141f98f140764b34a66ef/FLAGa522e0e48 [2020-08-22 03:48:44,294 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 03:48:44,295 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-22 03:48:44,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/86d32713a/8d8d9f49f9b141f98f140764b34a66ef/FLAGa522e0e48 [2020-08-22 03:48:44,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/86d32713a/8d8d9f49f9b141f98f140764b34a66ef [2020-08-22 03:48:44,722 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 03:48:44,724 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 03:48:44,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 03:48:44,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 03:48:44,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 03:48:44,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 03:48:44" (1/1) ... [2020-08-22 03:48:44,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51a556b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:48:44, skipping insertion in model container [2020-08-22 03:48:44,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 03:48:44" (1/1) ... [2020-08-22 03:48:44,751 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 03:48:44,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 03:48:45,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 03:48:45,023 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 03:48:45,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 03:48:45,055 INFO L208 MainTranslator]: Completed translation [2020-08-22 03:48:45,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:48:45 WrapperNode [2020-08-22 03:48:45,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 03:48:45,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 03:48:45,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 03:48:45,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 03:48:45,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:48:45" (1/1) ... [2020-08-22 03:48:45,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:48:45" (1/1) ... [2020-08-22 03:48:45,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:48:45" (1/1) ... [2020-08-22 03:48:45,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:48:45" (1/1) ... [2020-08-22 03:48:45,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:48:45" (1/1) ... [2020-08-22 03:48:45,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:48:45" (1/1) ... [2020-08-22 03:48:45,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:48:45" (1/1) ... [2020-08-22 03:48:45,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 03:48:45,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 03:48:45,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 03:48:45,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 03:48:45,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:48:45" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 03:48:45,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 03:48:45,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 03:48:45,309 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-22 03:48:45,310 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 03:48:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 03:48:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 03:48:45,311 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-22 03:48:45,312 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 03:48:45,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 03:48:45,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 03:48:45,504 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 03:48:45,505 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 03:48:45,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 03:48:45 BoogieIcfgContainer [2020-08-22 03:48:45,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 03:48:45,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 03:48:45,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 03:48:45,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 03:48:45,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 03:48:44" (1/3) ... [2020-08-22 03:48:45,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9d6856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 03:48:45, skipping insertion in model container [2020-08-22 03:48:45,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 03:48:45" (2/3) ... [2020-08-22 03:48:45,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9d6856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 03:48:45, skipping insertion in model container [2020-08-22 03:48:45,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 03:48:45" (3/3) ... [2020-08-22 03:48:45,519 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-22 03:48:45,530 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 03:48:45,537 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 03:48:45,552 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 03:48:45,576 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 03:48:45,577 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 03:48:45,577 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 03:48:45,577 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 03:48:45,577 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 03:48:45,578 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 03:48:45,578 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 03:48:45,578 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 03:48:45,597 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-22 03:48:45,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-22 03:48:45,604 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:48:45,605 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:48:45,605 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:48:45,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:48:45,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-22 03:48:45,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:48:45,622 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1773535450] [2020-08-22 03:48:45,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:48:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:45,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:48:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:45,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:48:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:45,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 03:48:45,852 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1773535450] [2020-08-22 03:48:45,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 03:48:45,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 03:48:45,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723010153] [2020-08-22 03:48:45,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 03:48:45,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:48:45,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 03:48:45,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 03:48:45,885 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-22 03:48:46,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:48:46,018 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-22 03:48:46,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 03:48:46,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-22 03:48:46,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:48:46,032 INFO L225 Difference]: With dead ends: 35 [2020-08-22 03:48:46,032 INFO L226 Difference]: Without dead ends: 21 [2020-08-22 03:48:46,036 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 03:48:46,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-22 03:48:46,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-22 03:48:46,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-22 03:48:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-22 03:48:46,086 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-22 03:48:46,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:48:46,087 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-22 03:48:46,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 03:48:46,088 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-22 03:48:46,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-22 03:48:46,089 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:48:46,090 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:48:46,090 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 03:48:46,091 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:48:46,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:48:46,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-22 03:48:46,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:48:46,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1932026156] [2020-08-22 03:48:46,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:48:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:46,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:48:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:46,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:48:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 03:48:46,181 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1932026156] [2020-08-22 03:48:46,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 03:48:46,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 03:48:46,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735366310] [2020-08-22 03:48:46,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 03:48:46,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:48:46,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 03:48:46,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 03:48:46,185 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-22 03:48:46,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:48:46,260 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-22 03:48:46,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 03:48:46,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-22 03:48:46,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:48:46,262 INFO L225 Difference]: With dead ends: 27 [2020-08-22 03:48:46,262 INFO L226 Difference]: Without dead ends: 23 [2020-08-22 03:48:46,265 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 03:48:46,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-22 03:48:46,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-22 03:48:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-22 03:48:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-22 03:48:46,279 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-22 03:48:46,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:48:46,279 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-22 03:48:46,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 03:48:46,280 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-22 03:48:46,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-22 03:48:46,281 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:48:46,282 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:48:46,282 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 03:48:46,282 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:48:46,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:48:46,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-22 03:48:46,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:48:46,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1522879206] [2020-08-22 03:48:46,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:48:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:46,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:48:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:46,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:48:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:46,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:46,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-22 03:48:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 03:48:46,429 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1522879206] [2020-08-22 03:48:46,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:48:46,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 03:48:46,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277797446] [2020-08-22 03:48:46,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 03:48:46,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:48:46,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 03:48:46,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 03:48:46,431 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-22 03:48:46,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:48:46,534 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-22 03:48:46,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 03:48:46,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-22 03:48:46,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:48:46,537 INFO L225 Difference]: With dead ends: 38 [2020-08-22 03:48:46,537 INFO L226 Difference]: Without dead ends: 23 [2020-08-22 03:48:46,538 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-08-22 03:48:46,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-22 03:48:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-22 03:48:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-22 03:48:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-22 03:48:46,546 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-22 03:48:46,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:48:46,547 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-22 03:48:46,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 03:48:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-22 03:48:46,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-22 03:48:46,549 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:48:46,549 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:48:46,549 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 03:48:46,550 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:48:46,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:48:46,550 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-22 03:48:46,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:48:46,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [414596553] [2020-08-22 03:48:46,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:48:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:46,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:48:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:46,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:48:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:46,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:46,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-22 03:48:46,713 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [414596553] [2020-08-22 03:48:46,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:48:46,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 03:48:46,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851743632] [2020-08-22 03:48:46,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 03:48:46,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:48:46,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 03:48:46,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 03:48:46,717 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-22 03:48:46,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:48:46,859 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-22 03:48:46,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 03:48:46,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-22 03:48:46,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:48:46,863 INFO L225 Difference]: With dead ends: 41 [2020-08-22 03:48:46,863 INFO L226 Difference]: Without dead ends: 37 [2020-08-22 03:48:46,864 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-22 03:48:46,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-22 03:48:46,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-22 03:48:46,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-22 03:48:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-22 03:48:46,877 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-22 03:48:46,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:48:46,877 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-22 03:48:46,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 03:48:46,878 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-22 03:48:46,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-22 03:48:46,880 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:48:46,880 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:48:46,881 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 03:48:46,881 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:48:46,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:48:46,882 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-22 03:48:46,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:48:46,882 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [804393063] [2020-08-22 03:48:46,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:48:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:46,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:48:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:46,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:48:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:48:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,077 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-22 03:48:47,078 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [804393063] [2020-08-22 03:48:47,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:48:47,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 03:48:47,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389726720] [2020-08-22 03:48:47,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 03:48:47,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:48:47,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 03:48:47,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 03:48:47,081 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-22 03:48:47,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:48:47,212 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-22 03:48:47,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 03:48:47,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-22 03:48:47,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:48:47,215 INFO L225 Difference]: With dead ends: 76 [2020-08-22 03:48:47,215 INFO L226 Difference]: Without dead ends: 45 [2020-08-22 03:48:47,217 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-22 03:48:47,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-22 03:48:47,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-22 03:48:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-22 03:48:47,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-22 03:48:47,229 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-22 03:48:47,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:48:47,229 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-22 03:48:47,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 03:48:47,230 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-22 03:48:47,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-22 03:48:47,232 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:48:47,232 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:48:47,232 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 03:48:47,232 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:48:47,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:48:47,233 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-22 03:48:47,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:48:47,233 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [347901958] [2020-08-22 03:48:47,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:48:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:48:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:48:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:48:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-22 03:48:47,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [347901958] [2020-08-22 03:48:47,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:48:47,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 03:48:47,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818621843] [2020-08-22 03:48:47,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 03:48:47,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:48:47,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 03:48:47,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 03:48:47,380 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-22 03:48:47,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:48:47,494 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-22 03:48:47,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 03:48:47,495 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-22 03:48:47,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:48:47,497 INFO L225 Difference]: With dead ends: 62 [2020-08-22 03:48:47,497 INFO L226 Difference]: Without dead ends: 58 [2020-08-22 03:48:47,498 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-22 03:48:47,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-22 03:48:47,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-22 03:48:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-22 03:48:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-22 03:48:47,512 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-22 03:48:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:48:47,512 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-22 03:48:47,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 03:48:47,513 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-22 03:48:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-22 03:48:47,515 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:48:47,516 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:48:47,516 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 03:48:47,516 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:48:47,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:48:47,517 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-22 03:48:47,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:48:47,517 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [872421796] [2020-08-22 03:48:47,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:48:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:48:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:48:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:48:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:48:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:48:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:48:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-08-22 03:48:47,754 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [872421796] [2020-08-22 03:48:47,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:48:47,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 03:48:47,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343916770] [2020-08-22 03:48:47,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 03:48:47,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:48:47,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 03:48:47,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-22 03:48:47,758 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-22 03:48:47,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:48:47,968 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-22 03:48:47,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 03:48:47,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-22 03:48:47,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:48:47,977 INFO L225 Difference]: With dead ends: 97 [2020-08-22 03:48:47,979 INFO L226 Difference]: Without dead ends: 93 [2020-08-22 03:48:47,980 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-22 03:48:47,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-22 03:48:48,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-22 03:48:48,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-22 03:48:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-22 03:48:48,025 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-22 03:48:48,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:48:48,026 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-22 03:48:48,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 03:48:48,027 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-22 03:48:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-22 03:48:48,032 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:48:48,032 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:48:48,032 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 03:48:48,033 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:48:48,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:48:48,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-22 03:48:48,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:48:48,034 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [466886484] [2020-08-22 03:48:48,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:48:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:48:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:48:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:48:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:48:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:48:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:48:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:48:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:48:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 381 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2020-08-22 03:48:48,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [466886484] [2020-08-22 03:48:48,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:48:48,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-22 03:48:48,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495968884] [2020-08-22 03:48:48,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 03:48:48,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:48:48,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 03:48:48,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-22 03:48:48,482 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-22 03:48:48,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:48:48,964 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-22 03:48:48,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-22 03:48:48,965 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-22 03:48:48,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:48:48,967 INFO L225 Difference]: With dead ends: 153 [2020-08-22 03:48:48,967 INFO L226 Difference]: Without dead ends: 71 [2020-08-22 03:48:48,970 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2020-08-22 03:48:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-22 03:48:48,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-22 03:48:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-22 03:48:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-22 03:48:48,980 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-22 03:48:48,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:48:48,981 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-22 03:48:48,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 03:48:48,981 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-22 03:48:48,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-22 03:48:48,983 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:48:48,983 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:48:48,983 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 03:48:48,983 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:48:48,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:48:48,984 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-22 03:48:48,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:48:48,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1307627369] [2020-08-22 03:48:48,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:48:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:48:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:48:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:48:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:48:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:48:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:48:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-08-22 03:48:49,212 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1307627369] [2020-08-22 03:48:49,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:48:49,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-22 03:48:49,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391665003] [2020-08-22 03:48:49,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 03:48:49,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:48:49,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 03:48:49,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-22 03:48:49,214 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-22 03:48:49,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:48:49,398 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-22 03:48:49,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 03:48:49,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-22 03:48:49,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:48:49,401 INFO L225 Difference]: With dead ends: 68 [2020-08-22 03:48:49,401 INFO L226 Difference]: Without dead ends: 64 [2020-08-22 03:48:49,402 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-22 03:48:49,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-22 03:48:49,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-22 03:48:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-22 03:48:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-22 03:48:49,411 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-22 03:48:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:48:49,412 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-22 03:48:49,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 03:48:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-22 03:48:49,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-22 03:48:49,414 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:48:49,414 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:48:49,415 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 03:48:49,415 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:48:49,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:48:49,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-22 03:48:49,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:48:49,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2002279727] [2020-08-22 03:48:49,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:48:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:48:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:48:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:48:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:48:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:48:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:48:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 03:48:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:48:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:48:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-08-22 03:48:49,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2002279727] [2020-08-22 03:48:49,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:48:49,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-22 03:48:49,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987230290] [2020-08-22 03:48:49,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 03:48:49,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:48:49,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 03:48:49,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-22 03:48:49,815 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-22 03:48:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:48:50,077 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-22 03:48:50,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 03:48:50,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-22 03:48:50,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:48:50,081 INFO L225 Difference]: With dead ends: 180 [2020-08-22 03:48:50,082 INFO L226 Difference]: Without dead ends: 176 [2020-08-22 03:48:50,082 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-22 03:48:50,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-22 03:48:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-22 03:48:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-22 03:48:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-22 03:48:50,126 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-22 03:48:50,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:48:50,129 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-22 03:48:50,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 03:48:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-22 03:48:50,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-22 03:48:50,138 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:48:50,138 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:48:50,138 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 03:48:50,138 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:48:50,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:48:50,138 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-22 03:48:50,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:48:50,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [111053200] [2020-08-22 03:48:50,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:48:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 03:48:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 03:48:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:48:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:48:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:48:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:48:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 03:48:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:48:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:48:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 03:48:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:48:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 03:48:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 03:48:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 03:48:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 03:48:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 03:48:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 03:48:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-08-22 03:48:50,953 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [111053200] [2020-08-22 03:48:50,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 03:48:50,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-22 03:48:50,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800011347] [2020-08-22 03:48:50,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 03:48:50,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 03:48:50,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 03:48:50,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-22 03:48:50,956 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-22 03:48:51,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 03:48:51,260 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-22 03:48:51,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 03:48:51,261 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-22 03:48:51,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 03:48:51,267 INFO L225 Difference]: With dead ends: 410 [2020-08-22 03:48:51,267 INFO L226 Difference]: Without dead ends: 406 [2020-08-22 03:48:51,268 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-08-22 03:48:51,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-22 03:48:51,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-22 03:48:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-22 03:48:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-22 03:48:51,305 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-22 03:48:51,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 03:48:51,306 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-22 03:48:51,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 03:48:51,306 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-22 03:48:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-22 03:48:51,315 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 03:48:51,316 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 03:48:51,316 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 03:48:51,316 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 03:48:51,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 03:48:51,316 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 9 times [2020-08-22 03:48:51,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 03:48:51,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1342350402] [2020-08-22 03:48:51,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 03:48:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 03:48:51,434 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-22 03:48:51,435 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 03:48:51,440 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 03:48:51,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 03:48:51 BoogieIcfgContainer [2020-08-22 03:48:51,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 03:48:51,490 INFO L168 Benchmark]: Toolchain (without parser) took 6765.38 ms. Allocated memory was 141.6 MB in the beginning and 323.5 MB in the end (delta: 181.9 MB). Free memory was 104.1 MB in the beginning and 170.3 MB in the end (delta: -66.3 MB). Peak memory consumption was 115.7 MB. Max. memory is 7.1 GB. [2020-08-22 03:48:51,491 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-22 03:48:51,492 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.69 ms. Allocated memory is still 141.6 MB. Free memory was 103.8 MB in the beginning and 94.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-08-22 03:48:51,492 INFO L168 Benchmark]: Boogie Preprocessor took 166.25 ms. Allocated memory was 141.6 MB in the beginning and 206.6 MB in the end (delta: 65.0 MB). Free memory was 94.4 MB in the beginning and 185.1 MB in the end (delta: -90.7 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2020-08-22 03:48:51,493 INFO L168 Benchmark]: RCFGBuilder took 286.21 ms. Allocated memory is still 206.6 MB. Free memory was 184.7 MB in the beginning and 173.0 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. [2020-08-22 03:48:51,494 INFO L168 Benchmark]: TraceAbstraction took 5976.21 ms. Allocated memory was 206.6 MB in the beginning and 323.5 MB in the end (delta: 116.9 MB). Free memory was 172.4 MB in the beginning and 170.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 119.0 MB. Max. memory is 7.1 GB. [2020-08-22 03:48:51,498 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.36 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 329.69 ms. Allocated memory is still 141.6 MB. Free memory was 103.8 MB in the beginning and 94.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 166.25 ms. Allocated memory was 141.6 MB in the beginning and 206.6 MB in the end (delta: 65.0 MB). Free memory was 94.4 MB in the beginning and 185.1 MB in the end (delta: -90.7 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 286.21 ms. Allocated memory is still 206.6 MB. Free memory was 184.7 MB in the beginning and 173.0 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5976.21 ms. Allocated memory was 206.6 MB in the beginning and 323.5 MB in the end (delta: 116.9 MB). Free memory was 172.4 MB in the beginning and 170.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 119.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.8s, OverallIterations: 12, TraceHistogramMax: 67, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 210 SDtfs, 310 SDslu, 530 SDs, 0 SdLazy, 890 SolverSat, 276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.0s 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, 11 MinimizatonAttempts, 54 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1442 NumberOfCodeBlocks, 1442 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 968 ConstructedInterpolants, 0 QuantifiedInterpolants, 243366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 6018/8497 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...