/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 16:34:04,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 16:34:04,388 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 16:34:04,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 16:34:04,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 16:34:04,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 16:34:04,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 16:34:04,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 16:34:04,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 16:34:04,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 16:34:04,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 16:34:04,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 16:34:04,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 16:34:04,422 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 16:34:04,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 16:34:04,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 16:34:04,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 16:34:04,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 16:34:04,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 16:34:04,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 16:34:04,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 16:34:04,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 16:34:04,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 16:34:04,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 16:34:04,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 16:34:04,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 16:34:04,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 16:34:04,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 16:34:04,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 16:34:04,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 16:34:04,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 16:34:04,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 16:34:04,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 16:34:04,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 16:34:04,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 16:34:04,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 16:34:04,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 16:34:04,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 16:34:04,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 16:34:04,447 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 16:34:04,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 16:34:04,449 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-22 16:34:04,471 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 16:34:04,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 16:34:04,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-22 16:34:04,473 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-22 16:34:04,473 INFO L138 SettingsManager]: * Use SBE=true [2020-08-22 16:34:04,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 16:34:04,473 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 16:34:04,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 16:34:04,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 16:34:04,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 16:34:04,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 16:34:04,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 16:34:04,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 16:34:04,475 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 16:34:04,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 16:34:04,475 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 16:34:04,475 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 16:34:04,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 16:34:04,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-22 16:34:04,476 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 16:34:04,476 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 16:34:04,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 16:34:04,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 16:34:04,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-22 16:34:04,477 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-22 16:34:04,477 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-22 16:34:04,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-22 16:34:04,477 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 16:34:04,478 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-22 16:34:04,478 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-08-22 16:34:04,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 16:34:04,798 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 16:34:04,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 16:34:04,803 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 16:34:04,804 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 16:34:04,805 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2020-08-22 16:34:04,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bb076ea4/fb67acb6c41f4efa8437293ae0e4effc/FLAG14f30e765 [2020-08-22 16:34:05,396 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 16:34:05,397 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2020-08-22 16:34:05,404 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bb076ea4/fb67acb6c41f4efa8437293ae0e4effc/FLAG14f30e765 [2020-08-22 16:34:05,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bb076ea4/fb67acb6c41f4efa8437293ae0e4effc [2020-08-22 16:34:05,767 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 16:34:05,770 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 16:34:05,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 16:34:05,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 16:34:05,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 16:34:05,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 04:34:05" (1/1) ... [2020-08-22 16:34:05,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f1d1049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:05, skipping insertion in model container [2020-08-22 16:34:05,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 04:34:05" (1/1) ... [2020-08-22 16:34:05,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 16:34:05,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 16:34:05,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 16:34:05,984 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 16:34:06,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 16:34:06,017 INFO L208 MainTranslator]: Completed translation [2020-08-22 16:34:06,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:06 WrapperNode [2020-08-22 16:34:06,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 16:34:06,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 16:34:06,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 16:34:06,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 16:34:06,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:06" (1/1) ... [2020-08-22 16:34:06,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:06" (1/1) ... [2020-08-22 16:34:06,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:06" (1/1) ... [2020-08-22 16:34:06,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:06" (1/1) ... [2020-08-22 16:34:06,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:06" (1/1) ... [2020-08-22 16:34:06,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:06" (1/1) ... [2020-08-22 16:34:06,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:06" (1/1) ... [2020-08-22 16:34:06,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 16:34:06,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 16:34:06,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 16:34:06,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 16:34:06,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 16:34:06,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 16:34:06,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 16:34:06,193 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-08-22 16:34:06,193 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-08-22 16:34:06,193 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 16:34:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 16:34:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 16:34:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-08-22 16:34:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-08-22 16:34:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 16:34:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 16:34:06,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 16:34:06,399 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 16:34:06,399 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 16:34:06,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 04:34:06 BoogieIcfgContainer [2020-08-22 16:34:06,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 16:34:06,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 16:34:06,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 16:34:06,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 16:34:06,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 04:34:05" (1/3) ... [2020-08-22 16:34:06,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c31bbc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 04:34:06, skipping insertion in model container [2020-08-22 16:34:06,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:34:06" (2/3) ... [2020-08-22 16:34:06,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c31bbc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 04:34:06, skipping insertion in model container [2020-08-22 16:34:06,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 04:34:06" (3/3) ... [2020-08-22 16:34:06,413 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2020-08-22 16:34:06,425 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-08-22 16:34:06,433 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 16:34:06,448 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 16:34:06,489 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 16:34:06,489 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 16:34:06,490 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-08-22 16:34:06,490 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 16:34:06,490 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 16:34:06,490 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 16:34:06,491 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 16:34:06,491 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 16:34:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-08-22 16:34:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-22 16:34:06,526 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:06,527 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:34:06,528 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:06,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:06,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2020-08-22 16:34:06,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:06,547 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141003734] [2020-08-22 16:34:06,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:06,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:34:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:06,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:34:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:06,788 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 16:34:06,789 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141003734] [2020-08-22 16:34:06,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:34:06,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 16:34:06,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566456087] [2020-08-22 16:34:06,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 16:34:06,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:34:06,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 16:34:06,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 16:34:06,813 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-08-22 16:34:06,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:34:06,915 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-08-22 16:34:06,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 16:34:06,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-22 16:34:06,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:34:06,931 INFO L225 Difference]: With dead ends: 44 [2020-08-22 16:34:06,932 INFO L226 Difference]: Without dead ends: 30 [2020-08-22 16:34:06,936 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 16:34:06,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-08-22 16:34:06,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-08-22 16:34:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-22 16:34:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-08-22 16:34:06,992 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2020-08-22 16:34:06,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:34:06,993 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-08-22 16:34:06,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 16:34:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-08-22 16:34:06,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-22 16:34:06,996 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:06,996 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:34:06,996 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 16:34:06,997 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:06,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:06,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2020-08-22 16:34:06,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:06,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462128087] [2020-08-22 16:34:06,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:07,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:34:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:07,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:34:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:07,091 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 16:34:07,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462128087] [2020-08-22 16:34:07,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:34:07,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 16:34:07,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052104180] [2020-08-22 16:34:07,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 16:34:07,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:34:07,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 16:34:07,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 16:34:07,102 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2020-08-22 16:34:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:34:07,194 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-08-22 16:34:07,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 16:34:07,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-22 16:34:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:34:07,197 INFO L225 Difference]: With dead ends: 36 [2020-08-22 16:34:07,198 INFO L226 Difference]: Without dead ends: 32 [2020-08-22 16:34:07,201 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 16:34:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-08-22 16:34:07,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-08-22 16:34:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-22 16:34:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-08-22 16:34:07,222 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2020-08-22 16:34:07,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:34:07,222 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-08-22 16:34:07,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 16:34:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-08-22 16:34:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-22 16:34:07,225 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:07,226 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:34:07,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 16:34:07,227 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:07,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:07,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2020-08-22 16:34:07,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:07,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093844739] [2020-08-22 16:34:07,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:07,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:34:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:07,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:34:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:07,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:07,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-22 16:34:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-22 16:34:07,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093844739] [2020-08-22 16:34:07,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844744238] [2020-08-22 16:34:07,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:07,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-08-22 16:34:07,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:34:07,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-22 16:34:07,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:34:07,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-08-22 16:34:07,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454581022] [2020-08-22 16:34:07,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 16:34:07,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:34:07,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 16:34:07,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-08-22 16:34:07,561 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 10 states. [2020-08-22 16:34:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:34:07,778 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-08-22 16:34:07,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 16:34:07,779 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-08-22 16:34:07,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:34:07,780 INFO L225 Difference]: With dead ends: 58 [2020-08-22 16:34:07,780 INFO L226 Difference]: Without dead ends: 34 [2020-08-22 16:34:07,782 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-08-22 16:34:07,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-08-22 16:34:07,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-08-22 16:34:07,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-08-22 16:34:07,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-08-22 16:34:07,790 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2020-08-22 16:34:07,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:34:07,790 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-08-22 16:34:07,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 16:34:07,791 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-08-22 16:34:07,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-22 16:34:07,792 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:07,793 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:34:08,006 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-08-22 16:34:08,006 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:08,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:08,007 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2020-08-22 16:34:08,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:08,008 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033902630] [2020-08-22 16:34:08,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:08,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:34:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:08,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:34:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:08,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:08,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:08,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-22 16:34:08,142 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033902630] [2020-08-22 16:34:08,142 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519181874] [2020-08-22 16:34:08,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:08,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-08-22 16:34:08,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:34:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-22 16:34:08,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:34:08,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-08-22 16:34:08,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74270513] [2020-08-22 16:34:08,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 16:34:08,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:34:08,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 16:34:08,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-08-22 16:34:08,237 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 9 states. [2020-08-22 16:34:08,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:34:08,429 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-08-22 16:34:08,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 16:34:08,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-08-22 16:34:08,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:34:08,434 INFO L225 Difference]: With dead ends: 54 [2020-08-22 16:34:08,435 INFO L226 Difference]: Without dead ends: 50 [2020-08-22 16:34:08,436 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-08-22 16:34:08,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-08-22 16:34:08,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-08-22 16:34:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-08-22 16:34:08,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2020-08-22 16:34:08,447 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 27 [2020-08-22 16:34:08,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:34:08,448 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2020-08-22 16:34:08,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 16:34:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2020-08-22 16:34:08,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-08-22 16:34:08,450 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:08,450 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:34:08,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:08,663 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:08,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:08,664 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2020-08-22 16:34:08,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:08,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067171104] [2020-08-22 16:34:08,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:08,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:34:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:08,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:34:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:08,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:08,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:08,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-22 16:34:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:08,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 16:34:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-08-22 16:34:08,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067171104] [2020-08-22 16:34:08,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228019728] [2020-08-22 16:34:08,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:08,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2020-08-22 16:34:08,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:34:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-22 16:34:08,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:34:08,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2020-08-22 16:34:08,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132019645] [2020-08-22 16:34:08,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 16:34:08,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:34:08,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 16:34:08,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-08-22 16:34:08,879 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 11 states. [2020-08-22 16:34:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:34:09,167 INFO L93 Difference]: Finished difference Result 108 states and 170 transitions. [2020-08-22 16:34:09,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-22 16:34:09,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-08-22 16:34:09,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:34:09,170 INFO L225 Difference]: With dead ends: 108 [2020-08-22 16:34:09,170 INFO L226 Difference]: Without dead ends: 66 [2020-08-22 16:34:09,185 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-22 16:34:09,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-08-22 16:34:09,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-08-22 16:34:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-08-22 16:34:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2020-08-22 16:34:09,198 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 39 [2020-08-22 16:34:09,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:34:09,198 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2020-08-22 16:34:09,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 16:34:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2020-08-22 16:34:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-22 16:34:09,201 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:09,201 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:34:09,416 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:09,416 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:09,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:09,417 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2020-08-22 16:34:09,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:09,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643725777] [2020-08-22 16:34:09,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:09,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:34:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:09,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:34:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:09,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:09,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:09,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:09,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:34:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-08-22 16:34:09,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643725777] [2020-08-22 16:34:09,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933391583] [2020-08-22 16:34:09,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:09,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2020-08-22 16:34:09,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:34:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-08-22 16:34:09,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:34:09,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-08-22 16:34:09,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443865298] [2020-08-22 16:34:09,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 16:34:09,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:34:09,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 16:34:09,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-08-22 16:34:09,674 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand 13 states. [2020-08-22 16:34:10,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:34:10,098 INFO L93 Difference]: Finished difference Result 180 states and 324 transitions. [2020-08-22 16:34:10,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 16:34:10,099 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-08-22 16:34:10,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:34:10,102 INFO L225 Difference]: With dead ends: 180 [2020-08-22 16:34:10,102 INFO L226 Difference]: Without dead ends: 120 [2020-08-22 16:34:10,105 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2020-08-22 16:34:10,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-08-22 16:34:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2020-08-22 16:34:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-08-22 16:34:10,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 169 transitions. [2020-08-22 16:34:10,130 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 169 transitions. Word has length 40 [2020-08-22 16:34:10,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:34:10,131 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 169 transitions. [2020-08-22 16:34:10,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 16:34:10,131 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 169 transitions. [2020-08-22 16:34:10,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-08-22 16:34:10,135 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:10,135 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:34:10,338 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:10,339 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:10,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:10,339 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2020-08-22 16:34:10,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:10,340 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757180732] [2020-08-22 16:34:10,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:10,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:34:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:10,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:34:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:10,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:10,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:10,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:10,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:10,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:34:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:10,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-22 16:34:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:10,487 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-08-22 16:34:10,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757180732] [2020-08-22 16:34:10,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709364810] [2020-08-22 16:34:10,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:10,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2020-08-22 16:34:10,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:34:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-22 16:34:10,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:34:10,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2020-08-22 16:34:10,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104719903] [2020-08-22 16:34:10,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-22 16:34:10,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:34:10,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-22 16:34:10,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-08-22 16:34:10,684 INFO L87 Difference]: Start difference. First operand 106 states and 169 transitions. Second operand 14 states. [2020-08-22 16:34:11,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:34:11,231 INFO L93 Difference]: Finished difference Result 258 states and 498 transitions. [2020-08-22 16:34:11,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-22 16:34:11,235 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2020-08-22 16:34:11,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:34:11,238 INFO L225 Difference]: With dead ends: 258 [2020-08-22 16:34:11,239 INFO L226 Difference]: Without dead ends: 158 [2020-08-22 16:34:11,240 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2020-08-22 16:34:11,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-08-22 16:34:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2020-08-22 16:34:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-22 16:34:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 180 transitions. [2020-08-22 16:34:11,268 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 180 transitions. Word has length 54 [2020-08-22 16:34:11,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:34:11,268 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 180 transitions. [2020-08-22 16:34:11,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-22 16:34:11,269 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 180 transitions. [2020-08-22 16:34:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-08-22 16:34:11,273 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:11,273 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:34:11,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-08-22 16:34:11,488 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:11,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:11,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1504181040, now seen corresponding path program 1 times [2020-08-22 16:34:11,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:11,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095798073] [2020-08-22 16:34:11,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:11,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:34:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:11,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:34:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:11,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:11,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:11,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:11,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:11,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:11,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:34:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:11,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:34:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:11,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-08-22 16:34:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:11,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:11,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:11,729 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2020-08-22 16:34:11,730 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095798073] [2020-08-22 16:34:11,730 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750718321] [2020-08-22 16:34:11,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:11,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjunts are in the unsatisfiable core [2020-08-22 16:34:11,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:34:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 68 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-08-22 16:34:11,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:34:11,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-08-22 16:34:11,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423399692] [2020-08-22 16:34:11,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-22 16:34:11,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:34:11,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-22 16:34:11,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-08-22 16:34:11,890 INFO L87 Difference]: Start difference. First operand 112 states and 180 transitions. Second operand 16 states. [2020-08-22 16:34:12,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:34:12,510 INFO L93 Difference]: Finished difference Result 243 states and 465 transitions. [2020-08-22 16:34:12,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-08-22 16:34:12,510 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 82 [2020-08-22 16:34:12,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:34:12,513 INFO L225 Difference]: With dead ends: 243 [2020-08-22 16:34:12,513 INFO L226 Difference]: Without dead ends: 110 [2020-08-22 16:34:12,515 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2020-08-22 16:34:12,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-08-22 16:34:12,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 87. [2020-08-22 16:34:12,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-22 16:34:12,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2020-08-22 16:34:12,532 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 82 [2020-08-22 16:34:12,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:34:12,533 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2020-08-22 16:34:12,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-22 16:34:12,533 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2020-08-22 16:34:12,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-08-22 16:34:12,538 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:12,538 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:34:12,752 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:12,752 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:12,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:12,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2095197631, now seen corresponding path program 1 times [2020-08-22 16:34:12,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:12,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577532012] [2020-08-22 16:34:12,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:12,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:34:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:12,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:34:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:12,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:12,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:12,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:12,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:12,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:12,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:12,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:34:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:12,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:34:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:12,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-08-22 16:34:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:12,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:12,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:12,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-08-22 16:34:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:12,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:12,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:12,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:12,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:34:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:13,002 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 61 proven. 94 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2020-08-22 16:34:13,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577532012] [2020-08-22 16:34:13,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470261680] [2020-08-22 16:34:13,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:13,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 10 conjunts are in the unsatisfiable core [2020-08-22 16:34:13,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:34:13,155 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 48 proven. 89 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-08-22 16:34:13,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:34:13,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2020-08-22 16:34:13,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333620320] [2020-08-22 16:34:13,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-22 16:34:13,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:34:13,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-22 16:34:13,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-08-22 16:34:13,157 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand 15 states. [2020-08-22 16:34:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:34:13,673 INFO L93 Difference]: Finished difference Result 172 states and 251 transitions. [2020-08-22 16:34:13,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-22 16:34:13,674 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 123 [2020-08-22 16:34:13,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:34:13,676 INFO L225 Difference]: With dead ends: 172 [2020-08-22 16:34:13,677 INFO L226 Difference]: Without dead ends: 96 [2020-08-22 16:34:13,678 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2020-08-22 16:34:13,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-08-22 16:34:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2020-08-22 16:34:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-08-22 16:34:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 121 transitions. [2020-08-22 16:34:13,691 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 121 transitions. Word has length 123 [2020-08-22 16:34:13,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:34:13,691 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 121 transitions. [2020-08-22 16:34:13,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-22 16:34:13,691 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 121 transitions. [2020-08-22 16:34:13,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-08-22 16:34:13,693 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:13,694 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:34:13,899 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:13,900 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:13,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:13,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1830253150, now seen corresponding path program 2 times [2020-08-22 16:34:13,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:13,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183271729] [2020-08-22 16:34:13,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:13,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:34:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:13,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:34:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:13,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:13,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:14,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:14,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:14,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:14,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:14,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:34:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:14,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:34:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:14,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:14,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:14,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-08-22 16:34:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:14,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:14,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:14,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-08-22 16:34:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:14,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:14,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:14,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:14,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:34:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 110 proven. 86 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2020-08-22 16:34:14,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183271729] [2020-08-22 16:34:14,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811784572] [2020-08-22 16:34:14,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:14,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-08-22 16:34:14,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-08-22 16:34:14,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjunts are in the unsatisfiable core [2020-08-22 16:34:14,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:34:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 78 proven. 108 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2020-08-22 16:34:14,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:34:14,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2020-08-22 16:34:14,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637380239] [2020-08-22 16:34:14,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-22 16:34:14,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:34:14,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-22 16:34:14,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2020-08-22 16:34:14,363 INFO L87 Difference]: Start difference. First operand 90 states and 121 transitions. Second operand 18 states. [2020-08-22 16:34:14,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:34:14,878 INFO L93 Difference]: Finished difference Result 204 states and 330 transitions. [2020-08-22 16:34:14,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-22 16:34:14,879 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 137 [2020-08-22 16:34:14,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:34:14,880 INFO L225 Difference]: With dead ends: 204 [2020-08-22 16:34:14,881 INFO L226 Difference]: Without dead ends: 98 [2020-08-22 16:34:14,882 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2020-08-22 16:34:14,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-08-22 16:34:14,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2020-08-22 16:34:14,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-08-22 16:34:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2020-08-22 16:34:14,893 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 137 [2020-08-22 16:34:14,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:34:14,894 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2020-08-22 16:34:14,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-22 16:34:14,894 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2020-08-22 16:34:14,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-22 16:34:14,896 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:14,896 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:34:15,110 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-08-22 16:34:15,110 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:15,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:15,111 INFO L82 PathProgramCache]: Analyzing trace with hash -529934979, now seen corresponding path program 1 times [2020-08-22 16:34:15,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:15,112 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384732584] [2020-08-22 16:34:15,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:34:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:34:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:34:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:34:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 16:34:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:34:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 16:34:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:34:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:34:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:34:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,438 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 144 proven. 139 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2020-08-22 16:34:15,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384732584] [2020-08-22 16:34:15,440 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202374764] [2020-08-22 16:34:15,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:34:15,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 10 conjunts are in the unsatisfiable core [2020-08-22 16:34:15,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:34:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 141 proven. 34 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2020-08-22 16:34:15,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:34:15,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 17 [2020-08-22 16:34:15,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978699037] [2020-08-22 16:34:15,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-22 16:34:15,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:34:15,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-22 16:34:15,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-08-22 16:34:15,591 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand 17 states. [2020-08-22 16:34:16,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:34:16,105 INFO L93 Difference]: Finished difference Result 202 states and 257 transitions. [2020-08-22 16:34:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-08-22 16:34:16,106 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 150 [2020-08-22 16:34:16,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:34:16,109 INFO L225 Difference]: With dead ends: 202 [2020-08-22 16:34:16,109 INFO L226 Difference]: Without dead ends: 114 [2020-08-22 16:34:16,110 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2020-08-22 16:34:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-08-22 16:34:16,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2020-08-22 16:34:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-08-22 16:34:16,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2020-08-22 16:34:16,121 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 150 [2020-08-22 16:34:16,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:34:16,122 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2020-08-22 16:34:16,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-22 16:34:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2020-08-22 16:34:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-22 16:34:16,125 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:34:16,125 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:34:16,339 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:34:16,340 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:34:16,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:34:16,341 INFO L82 PathProgramCache]: Analyzing trace with hash 307857833, now seen corresponding path program 2 times [2020-08-22 16:34:16,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:34:16,342 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483668755] [2020-08-22 16:34:16,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:34:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 16:34:16,371 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 16:34:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 16:34:16,393 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 16:34:16,432 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-08-22 16:34:16,432 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 16:34:16,433 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 16:34:16,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 04:34:16 BoogieIcfgContainer [2020-08-22 16:34:16,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 16:34:16,483 INFO L168 Benchmark]: Toolchain (without parser) took 10712.88 ms. Allocated memory was 138.9 MB in the beginning and 342.4 MB in the end (delta: 203.4 MB). Free memory was 101.8 MB in the beginning and 310.4 MB in the end (delta: -208.6 MB). Peak memory consumption was 215.9 MB. Max. memory is 7.1 GB. [2020-08-22 16:34:16,484 INFO L168 Benchmark]: CDTParser took 1.44 ms. Allocated memory is still 138.9 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-22 16:34:16,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.44 ms. Allocated memory is still 138.9 MB. Free memory was 101.6 MB in the beginning and 91.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-08-22 16:34:16,485 INFO L168 Benchmark]: Boogie Preprocessor took 108.38 ms. Allocated memory was 138.9 MB in the beginning and 201.3 MB in the end (delta: 62.4 MB). Free memory was 91.6 MB in the beginning and 179.4 MB in the end (delta: -87.7 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2020-08-22 16:34:16,486 INFO L168 Benchmark]: RCFGBuilder took 276.65 ms. Allocated memory is still 201.3 MB. Free memory was 179.4 MB in the beginning and 166.6 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2020-08-22 16:34:16,487 INFO L168 Benchmark]: TraceAbstraction took 10075.15 ms. Allocated memory was 201.3 MB in the beginning and 342.4 MB in the end (delta: 141.0 MB). Free memory was 166.6 MB in the beginning and 310.4 MB in the end (delta: -143.9 MB). Peak memory consumption was 218.2 MB. Max. memory is 7.1 GB. [2020-08-22 16:34:16,491 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.44 ms. Allocated memory is still 138.9 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 244.44 ms. Allocated memory is still 138.9 MB. Free memory was 101.6 MB in the beginning and 91.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.38 ms. Allocated memory was 138.9 MB in the beginning and 201.3 MB in the end (delta: 62.4 MB). Free memory was 91.6 MB in the beginning and 179.4 MB in the end (delta: -87.7 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 276.65 ms. Allocated memory is still 201.3 MB. Free memory was 179.4 MB in the beginning and 166.6 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10075.15 ms. Allocated memory was 201.3 MB in the beginning and 342.4 MB in the end (delta: 141.0 MB). Free memory was 166.6 MB in the beginning and 310.4 MB in the end (delta: -143.9 MB). Peak memory consumption was 218.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 6; VAL [x=6] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L37] int result = fibo1(x); [L38] COND TRUE result == 8 VAL [result=8, x=6] [L39] __VERIFIER_error() VAL [result=8, x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.9s, OverallIterations: 12, TraceHistogramMax: 13, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 342 SDtfs, 494 SDslu, 2076 SDs, 0 SdLazy, 2901 SolverSat, 493 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1080 GetRequests, 884 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 101 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1560 NumberOfCodeBlocks, 1560 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1363 ConstructedInterpolants, 0 QuantifiedInterpolants, 218669 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1524 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 2424/3144 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...