./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/sum_10x0_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive-simple/sum_10x0_false-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 03b834537fd67eba3e98faa1fce1fca3851f5bba ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 10:04:48,306 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 10:04:48,308 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 10:04:48,320 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 10:04:48,321 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 10:04:48,322 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 10:04:48,324 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 10:04:48,326 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 10:04:48,328 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 10:04:48,329 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 10:04:48,330 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 10:04:48,331 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 10:04:48,332 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 10:04:48,334 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 10:04:48,335 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 10:04:48,336 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 10:04:48,337 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 10:04:48,339 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 10:04:48,342 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 10:04:48,344 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 10:04:48,345 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 10:04:48,346 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 10:04:48,349 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 10:04:48,350 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 10:04:48,350 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 10:04:48,351 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 10:04:48,352 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 10:04:48,353 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 10:04:48,354 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 10:04:48,355 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 10:04:48,356 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 10:04:48,357 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 10:04:48,357 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 10:04:48,357 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 10:04:48,358 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 10:04:48,365 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 10:04:48,365 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 10:04:48,396 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 10:04:48,396 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 10:04:48,399 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 10:04:48,400 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 10:04:48,400 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 10:04:48,400 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 10:04:48,400 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 10:04:48,401 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 10:04:48,401 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 10:04:48,401 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 10:04:48,401 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 10:04:48,401 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 10:04:48,401 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 10:04:48,403 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 10:04:48,404 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 10:04:48,404 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 10:04:48,404 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 10:04:48,404 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 10:04:48,404 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 10:04:48,405 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 10:04:48,407 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 10:04:48,407 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 10:04:48,408 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 10:04:48,408 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 10:04:48,408 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 10:04:48,408 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 10:04:48,409 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 10:04:48,409 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 10:04:48,409 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03b834537fd67eba3e98faa1fce1fca3851f5bba [2018-12-31 10:04:48,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 10:04:48,470 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 10:04:48,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 10:04:48,476 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 10:04:48,477 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 10:04:48,477 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/sum_10x0_false-unreach-call_true-termination.c [2018-12-31 10:04:48,541 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/498fb3a37/49b5ea52bfd24f6ba4c6cd166c1a1ff6/FLAG5b619a4d5 [2018-12-31 10:04:48,992 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 10:04:48,993 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/sum_10x0_false-unreach-call_true-termination.c [2018-12-31 10:04:48,999 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/498fb3a37/49b5ea52bfd24f6ba4c6cd166c1a1ff6/FLAG5b619a4d5 [2018-12-31 10:04:49,364 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/498fb3a37/49b5ea52bfd24f6ba4c6cd166c1a1ff6 [2018-12-31 10:04:49,370 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 10:04:49,372 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 10:04:49,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 10:04:49,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 10:04:49,377 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 10:04:49,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:04:49" (1/1) ... [2018-12-31 10:04:49,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ccd2864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:49, skipping insertion in model container [2018-12-31 10:04:49,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:04:49" (1/1) ... [2018-12-31 10:04:49,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 10:04:49,408 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 10:04:49,609 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:04:49,614 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 10:04:49,632 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:04:49,649 INFO L195 MainTranslator]: Completed translation [2018-12-31 10:04:49,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:49 WrapperNode [2018-12-31 10:04:49,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 10:04:49,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 10:04:49,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 10:04:49,651 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 10:04:49,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:49" (1/1) ... [2018-12-31 10:04:49,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:49" (1/1) ... [2018-12-31 10:04:49,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 10:04:49,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 10:04:49,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 10:04:49,694 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 10:04:49,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:49" (1/1) ... [2018-12-31 10:04:49,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:49" (1/1) ... [2018-12-31 10:04:49,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:49" (1/1) ... [2018-12-31 10:04:49,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:49" (1/1) ... [2018-12-31 10:04:49,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:49" (1/1) ... [2018-12-31 10:04:49,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:49" (1/1) ... [2018-12-31 10:04:49,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:49" (1/1) ... [2018-12-31 10:04:49,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 10:04:49,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 10:04:49,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 10:04:49,720 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 10:04:49,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:49" (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 [2018-12-31 10:04:49,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 10:04:49,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 10:04:49,886 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-12-31 10:04:49,886 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-12-31 10:04:50,162 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 10:04:50,162 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 10:04:50,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:04:50 BoogieIcfgContainer [2018-12-31 10:04:50,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 10:04:50,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 10:04:50,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 10:04:50,168 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 10:04:50,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:04:49" (1/3) ... [2018-12-31 10:04:50,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b5622a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:04:50, skipping insertion in model container [2018-12-31 10:04:50,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:04:49" (2/3) ... [2018-12-31 10:04:50,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b5622a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:04:50, skipping insertion in model container [2018-12-31 10:04:50,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:04:50" (3/3) ... [2018-12-31 10:04:50,172 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_10x0_false-unreach-call_true-termination.c [2018-12-31 10:04:50,183 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 10:04:50,192 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 10:04:50,208 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 10:04:50,240 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 10:04:50,240 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 10:04:50,241 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 10:04:50,241 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 10:04:50,241 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 10:04:50,241 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 10:04:50,242 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 10:04:50,242 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 10:04:50,242 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 10:04:50,261 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2018-12-31 10:04:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-31 10:04:50,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:04:50,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:04:50,272 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:04:50,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:04:50,279 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2018-12-31 10:04:50,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:04:50,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:04:50,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:50,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:04:50,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:04:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:04:50,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:04:50,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 10:04:50,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:04:50,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:04:50,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:04:50,638 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2018-12-31 10:04:50,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:04:50,771 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-12-31 10:04:50,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:04:50,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-31 10:04:50,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:04:50,783 INFO L225 Difference]: With dead ends: 24 [2018-12-31 10:04:50,783 INFO L226 Difference]: Without dead ends: 14 [2018-12-31 10:04:50,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-31 10:04:50,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-31 10:04:50,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-31 10:04:50,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-31 10:04:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-12-31 10:04:50,830 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2018-12-31 10:04:50,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:04:50,830 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-12-31 10:04:50,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:04:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-12-31 10:04:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 10:04:50,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:04:50,833 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:04:50,833 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:04:50,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:04:50,834 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2018-12-31 10:04:50,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:04:50,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:04:50,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:50,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:04:50,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:04:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 10:04:50,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:04:50,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:04:50,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:04:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:04:51,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:04:51,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 10:04:51,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:04:51,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-31 10:04:51,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 10:04:51,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 10:04:51,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 10:04:51,124 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2018-12-31 10:04:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:04:51,476 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-12-31 10:04:51,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 10:04:51,478 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-31 10:04:51,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:04:51,479 INFO L225 Difference]: With dead ends: 21 [2018-12-31 10:04:51,479 INFO L226 Difference]: Without dead ends: 17 [2018-12-31 10:04:51,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-31 10:04:51,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-31 10:04:51,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-31 10:04:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-31 10:04:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-31 10:04:51,487 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2018-12-31 10:04:51,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:04:51,487 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-31 10:04:51,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 10:04:51,487 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-31 10:04:51,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 10:04:51,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:04:51,488 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:04:51,490 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:04:51,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:04:51,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2018-12-31 10:04:51,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:04:51,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:04:51,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:51,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:04:51,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:04:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-31 10:04:51,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:04:51,720 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:04:51,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 10:04:51,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 10:04:51,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:04:51,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:04:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-31 10:04:51,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:04:51,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-31 10:04:51,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 10:04:51,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 10:04:51,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 10:04:51,831 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2018-12-31 10:04:52,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:04:52,089 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-12-31 10:04:52,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 10:04:52,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-31 10:04:52,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:04:52,093 INFO L225 Difference]: With dead ends: 24 [2018-12-31 10:04:52,093 INFO L226 Difference]: Without dead ends: 20 [2018-12-31 10:04:52,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-31 10:04:52,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-31 10:04:52,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-31 10:04:52,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-31 10:04:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-12-31 10:04:52,101 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2018-12-31 10:04:52,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:04:52,101 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-31 10:04:52,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 10:04:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-12-31 10:04:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 10:04:52,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:04:52,103 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:04:52,103 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:04:52,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:04:52,103 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2018-12-31 10:04:52,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:04:52,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:04:52,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:52,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:04:52,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:04:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-31 10:04:52,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:04:52,249 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:04:52,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 10:04:52,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-31 10:04:52,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:04:52,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:04:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-31 10:04:52,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:04:52,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-31 10:04:52,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 10:04:52,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 10:04:52,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-31 10:04:52,363 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 8 states. [2018-12-31 10:04:52,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:04:52,882 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-12-31 10:04:52,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 10:04:52,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-31 10:04:52,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:04:52,884 INFO L225 Difference]: With dead ends: 27 [2018-12-31 10:04:52,884 INFO L226 Difference]: Without dead ends: 23 [2018-12-31 10:04:52,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-31 10:04:52,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-31 10:04:52,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-31 10:04:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 10:04:52,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-31 10:04:52,891 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2018-12-31 10:04:52,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:04:52,891 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-31 10:04:52,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 10:04:52,892 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-31 10:04:52,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 10:04:52,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:04:52,893 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:04:52,894 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:04:52,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:04:52,894 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2018-12-31 10:04:52,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:04:52,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:04:52,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:52,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:04:52,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:04:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-31 10:04:53,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:04:53,058 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:04:53,079 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 10:04:53,105 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 10:04:53,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:04:53,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:04:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-31 10:04:53,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:04:53,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-31 10:04:53,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 10:04:53,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 10:04:53,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-31 10:04:53,150 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2018-12-31 10:04:53,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:04:53,333 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-12-31 10:04:53,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 10:04:53,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-12-31 10:04:53,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:04:53,335 INFO L225 Difference]: With dead ends: 30 [2018-12-31 10:04:53,335 INFO L226 Difference]: Without dead ends: 26 [2018-12-31 10:04:53,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-31 10:04:53,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-31 10:04:53,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-31 10:04:53,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 10:04:53,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-12-31 10:04:53,343 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2018-12-31 10:04:53,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:04:53,343 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-12-31 10:04:53,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 10:04:53,344 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-12-31 10:04:53,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-31 10:04:53,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:04:53,345 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:04:53,346 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:04:53,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:04:53,346 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2018-12-31 10:04:53,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:04:53,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:04:53,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:53,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:04:53,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:04:53,550 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-31 10:04:53,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:04:53,550 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:04:53,572 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 10:04:53,674 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-31 10:04:53,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:04:53,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:04:53,730 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-31 10:04:53,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:04:53,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-12-31 10:04:53,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 10:04:53,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 10:04:53,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-31 10:04:53,765 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 10 states. [2018-12-31 10:04:53,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:04:53,986 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-12-31 10:04:53,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 10:04:53,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-12-31 10:04:53,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:04:53,988 INFO L225 Difference]: With dead ends: 33 [2018-12-31 10:04:53,988 INFO L226 Difference]: Without dead ends: 29 [2018-12-31 10:04:53,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-12-31 10:04:53,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-31 10:04:53,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-31 10:04:53,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-31 10:04:53,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-31 10:04:53,995 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2018-12-31 10:04:53,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:04:53,996 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-31 10:04:53,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 10:04:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-31 10:04:53,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 10:04:53,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:04:53,998 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:04:53,998 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:04:53,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:04:54,000 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2018-12-31 10:04:54,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:04:54,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:04:54,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:54,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:04:54,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:04:54,197 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-31 10:04:54,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:04:54,197 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:04:54,207 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 10:04:54,267 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-12-31 10:04:54,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:04:54,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:04:54,308 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-31 10:04:54,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:04:54,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-31 10:04:54,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 10:04:54,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 10:04:54,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-31 10:04:54,329 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 11 states. [2018-12-31 10:04:54,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:04:54,562 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-12-31 10:04:54,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 10:04:54,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2018-12-31 10:04:54,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:04:54,565 INFO L225 Difference]: With dead ends: 36 [2018-12-31 10:04:54,565 INFO L226 Difference]: Without dead ends: 32 [2018-12-31 10:04:54,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-12-31 10:04:54,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-31 10:04:54,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-31 10:04:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-31 10:04:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-12-31 10:04:54,573 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2018-12-31 10:04:54,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:04:54,573 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-12-31 10:04:54,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 10:04:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-12-31 10:04:54,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 10:04:54,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:04:54,575 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:04:54,576 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:04:54,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:04:54,576 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2018-12-31 10:04:54,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:04:54,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:04:54,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:54,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:04:54,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:04:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-31 10:04:54,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:04:54,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:04:54,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:04:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:04:54,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:04:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-31 10:04:54,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:04:54,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-12-31 10:04:54,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 10:04:54,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 10:04:54,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-12-31 10:04:54,837 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 12 states. [2018-12-31 10:04:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:04:55,266 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-31 10:04:55,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 10:04:55,266 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-12-31 10:04:55,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:04:55,268 INFO L225 Difference]: With dead ends: 39 [2018-12-31 10:04:55,268 INFO L226 Difference]: Without dead ends: 35 [2018-12-31 10:04:55,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-12-31 10:04:55,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-31 10:04:55,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-31 10:04:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-31 10:04:55,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-31 10:04:55,275 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2018-12-31 10:04:55,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:04:55,275 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-31 10:04:55,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 10:04:55,276 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-31 10:04:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-31 10:04:55,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:04:55,277 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:04:55,278 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:04:55,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:04:55,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2018-12-31 10:04:55,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:04:55,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:04:55,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:55,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:04:55,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:04:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-31 10:04:55,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:04:55,530 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:04:55,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 10:04:55,587 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 10:04:55,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:04:55,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:04:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-31 10:04:55,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:04:55,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-12-31 10:04:55,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 10:04:55,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 10:04:55,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-12-31 10:04:55,646 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2018-12-31 10:04:55,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:04:55,867 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-12-31 10:04:55,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 10:04:55,869 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-12-31 10:04:55,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:04:55,870 INFO L225 Difference]: With dead ends: 42 [2018-12-31 10:04:55,871 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 10:04:55,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-12-31 10:04:55,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 10:04:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-31 10:04:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-31 10:04:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-12-31 10:04:55,878 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2018-12-31 10:04:55,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:04:55,879 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-12-31 10:04:55,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 10:04:55,879 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-12-31 10:04:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-31 10:04:55,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:04:55,880 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:04:55,881 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:04:55,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:04:55,881 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2018-12-31 10:04:55,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:04:55,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:04:55,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:55,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:04:55,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:04:56,405 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-31 10:04:56,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:04:56,405 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:04:56,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 10:04:56,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-31 10:04:56,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 10:04:56,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:04:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-31 10:04:56,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 10:04:56,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-12-31 10:04:56,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 10:04:56,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 10:04:56,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-12-31 10:04:56,582 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 14 states. [2018-12-31 10:04:56,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:04:56,857 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-12-31 10:04:56,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 10:04:56,858 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-12-31 10:04:56,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:04:56,860 INFO L225 Difference]: With dead ends: 45 [2018-12-31 10:04:56,861 INFO L226 Difference]: Without dead ends: 41 [2018-12-31 10:04:56,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-12-31 10:04:56,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-31 10:04:56,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-31 10:04:56,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-31 10:04:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-31 10:04:56,868 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2018-12-31 10:04:56,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:04:56,868 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-31 10:04:56,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 10:04:56,868 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-31 10:04:56,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 10:04:56,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:04:56,870 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:04:56,870 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:04:56,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:04:56,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2018-12-31 10:04:56,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:04:56,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:04:56,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:56,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 10:04:56,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:04:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 10:04:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 10:04:56,967 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 10:04:57,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:04:57 BoogieIcfgContainer [2018-12-31 10:04:57,039 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 10:04:57,040 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 10:04:57,040 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 10:04:57,040 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 10:04:57,042 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:04:50" (3/4) ... [2018-12-31 10:04:57,045 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 10:04:57,151 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 10:04:57,154 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 10:04:57,155 INFO L168 Benchmark]: Toolchain (without parser) took 7784.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -126.5 MB). Peak memory consumption was 81.1 MB. Max. memory is 11.5 GB. [2018-12-31 10:04:57,159 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:04:57,161 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.64 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 10:04:57,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.30 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:04:57,165 INFO L168 Benchmark]: Boogie Preprocessor took 25.93 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:04:57,166 INFO L168 Benchmark]: RCFGBuilder took 443.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -186.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-31 10:04:57,166 INFO L168 Benchmark]: TraceAbstraction took 6875.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.3 MB). Peak memory consumption was 103.5 MB. Max. memory is 11.5 GB. [2018-12-31 10:04:57,167 INFO L168 Benchmark]: Witness Printer took 114.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2018-12-31 10:04:57,177 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 277.64 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.30 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.93 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 443.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -186.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6875.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.3 MB). Peak memory consumption was 103.5 MB. Max. memory is 11.5 GB. * Witness Printer took 114.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 10; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=10, m=0, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=9, m=1, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=8, m=2, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=7, m=3, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=6, m=4, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=5, m=5, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=4, m=6, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=3, m=7, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=2, m=8, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=1, m=9, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=10, \old(n)=0, \result=10, m=10, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1, m=9, n=1, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2, m=8, n=2, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3, m=7, n=3, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4, m=6, n=4, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5, m=5, n=5, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6, m=4, n=6, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7, m=3, n=7, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8, m=2, n=8, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9, m=1, n=9, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=10, m=0, n=10, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. UNSAFE Result, 6.8s OverallTime, 11 OverallIterations, 11 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 82 SDtfs, 164 SDslu, 319 SDs, 0 SdLazy, 458 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 537 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 780 NumberOfCodeBlocks, 775 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 692 ConstructedInterpolants, 0 QuantifiedInterpolants, 77312 SizeOfPredicates, 63 NumberOfNonLiveVariables, 1051 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 900/1800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...