./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 91b1670e 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-91b1670 [2018-11-28 18:51:21,464 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:51:21,466 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:51:21,481 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:51:21,481 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:51:21,482 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:51:21,483 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:51:21,485 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:51:21,487 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:51:21,488 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:51:21,489 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:51:21,489 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:51:21,490 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:51:21,491 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:51:21,492 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:51:21,493 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:51:21,494 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:51:21,496 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:51:21,498 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:51:21,500 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:51:21,501 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:51:21,502 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:51:21,505 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:51:21,505 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:51:21,505 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:51:21,506 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:51:21,507 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:51:21,508 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:51:21,509 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:51:21,510 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:51:21,510 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:51:21,511 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:51:21,511 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:51:21,512 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:51:21,513 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:51:21,514 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:51:21,514 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:51:21,532 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:51:21,532 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:51:21,534 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:51:21,534 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:51:21,534 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:51:21,535 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:51:21,535 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:51:21,535 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:51:21,535 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:51:21,535 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:51:21,536 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:51:21,538 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:51:21,539 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:51:21,539 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:51:21,539 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:51:21,539 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:51:21,539 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:51:21,539 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:51:21,539 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:51:21,540 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:51:21,540 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:51:21,540 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:51:21,540 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:51:21,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:51:21,542 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:51:21,542 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:51:21,542 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:51:21,542 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:51:21,542 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:51:21,543 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:51:21,543 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-11-28 18:51:21,596 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:51:21,612 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:51:21,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:51:21,621 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:51:21,622 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:51:21,622 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/sum_10x0_false-unreach-call_true-termination.c [2018-11-28 18:51:21,685 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ad4c357/a1582879fc974ff4a38e0bea59f5776a/FLAGb619f21c6 [2018-11-28 18:51:22,141 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:51:22,142 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/sum_10x0_false-unreach-call_true-termination.c [2018-11-28 18:51:22,147 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ad4c357/a1582879fc974ff4a38e0bea59f5776a/FLAGb619f21c6 [2018-11-28 18:51:22,488 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ad4c357/a1582879fc974ff4a38e0bea59f5776a [2018-11-28 18:51:22,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:51:22,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:51:22,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:51:22,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:51:22,499 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:51:22,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:51:22" (1/1) ... [2018-11-28 18:51:22,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c5edb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:22, skipping insertion in model container [2018-11-28 18:51:22,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:51:22" (1/1) ... [2018-11-28 18:51:22,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:51:22,538 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:51:22,776 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:51:22,781 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:51:22,800 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:51:22,817 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:51:22,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:22 WrapperNode [2018-11-28 18:51:22,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:51:22,819 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:51:22,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:51:22,819 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:51:22,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:22" (1/1) ... [2018-11-28 18:51:22,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:22" (1/1) ... [2018-11-28 18:51:22,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:51:22,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:51:22,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:51:22,846 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:51:22,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:22" (1/1) ... [2018-11-28 18:51:22,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:22" (1/1) ... [2018-11-28 18:51:22,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:22" (1/1) ... [2018-11-28 18:51:22,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:22" (1/1) ... [2018-11-28 18:51:22,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:22" (1/1) ... [2018-11-28 18:51:22,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:22" (1/1) ... [2018-11-28 18:51:22,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:22" (1/1) ... [2018-11-28 18:51:22,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:51:22,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:51:22,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:51:22,871 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:51:22,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:22" (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-11-28 18:51:23,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:51:23,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:51:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:51:23,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:51:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-11-28 18:51:23,007 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-11-28 18:51:23,008 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:51:23,008 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:51:23,208 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:51:23,209 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 18:51:23,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:51:23 BoogieIcfgContainer [2018-11-28 18:51:23,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:51:23,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:51:23,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:51:23,223 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:51:23,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:51:22" (1/3) ... [2018-11-28 18:51:23,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b284ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:51:23, skipping insertion in model container [2018-11-28 18:51:23,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:51:22" (2/3) ... [2018-11-28 18:51:23,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b284ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:51:23, skipping insertion in model container [2018-11-28 18:51:23,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:51:23" (3/3) ... [2018-11-28 18:51:23,239 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_10x0_false-unreach-call_true-termination.c [2018-11-28 18:51:23,264 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:51:23,283 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:51:23,324 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:51:23,363 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:51:23,363 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:51:23,364 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:51:23,364 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:51:23,364 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:51:23,364 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:51:23,364 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:51:23,364 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:51:23,364 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:51:23,384 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-28 18:51:23,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 18:51:23,391 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:23,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:23,395 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:23,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:23,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2001781660, now seen corresponding path program 1 times [2018-11-28 18:51:23,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:23,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:23,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:23,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:23,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:23,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:51:23,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:51:23,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:51:23,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:51:23,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:51:23,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:51:23,674 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-11-28 18:51:23,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:23,844 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-28 18:51:23,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:51:23,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 18:51:23,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:23,861 INFO L225 Difference]: With dead ends: 30 [2018-11-28 18:51:23,862 INFO L226 Difference]: Without dead ends: 18 [2018-11-28 18:51:23,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:51:23,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-28 18:51:23,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-28 18:51:23,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 18:51:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-28 18:51:23,907 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-28 18:51:23,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:23,908 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-28 18:51:23,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:51:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-28 18:51:23,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 18:51:23,910 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:23,910 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:23,911 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:23,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:23,911 INFO L82 PathProgramCache]: Analyzing trace with hash -118151420, now seen corresponding path program 1 times [2018-11-28 18:51:23,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:23,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:23,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:23,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:23,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 18:51:24,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:24,029 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-11-28 18:51:24,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:24,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 18:51:24,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:24,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 18:51:24,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:51:24,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:51:24,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:51:24,167 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2018-11-28 18:51:24,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:24,506 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-28 18:51:24,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:51:24,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-28 18:51:24,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:24,508 INFO L225 Difference]: With dead ends: 25 [2018-11-28 18:51:24,508 INFO L226 Difference]: Without dead ends: 21 [2018-11-28 18:51:24,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:51:24,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-28 18:51:24,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-28 18:51:24,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 18:51:24,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-28 18:51:24,521 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-11-28 18:51:24,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:24,524 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-28 18:51:24,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:51:24,525 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-28 18:51:24,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 18:51:24,527 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:24,527 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:24,527 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:24,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:24,529 INFO L82 PathProgramCache]: Analyzing trace with hash 764931548, now seen corresponding path program 2 times [2018-11-28 18:51:24,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:24,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:24,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:24,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:24,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:24,732 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 18:51:24,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:24,732 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-11-28 18:51:24,752 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:51:24,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:51:24,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:24,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 18:51:24,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:24,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 18:51:24,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 18:51:24,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 18:51:24,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:51:24,863 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2018-11-28 18:51:25,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:25,086 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-28 18:51:25,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:51:25,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-28 18:51:25,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:25,089 INFO L225 Difference]: With dead ends: 28 [2018-11-28 18:51:25,089 INFO L226 Difference]: Without dead ends: 24 [2018-11-28 18:51:25,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:51:25,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-28 18:51:25,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-28 18:51:25,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 18:51:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-28 18:51:25,097 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2018-11-28 18:51:25,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:25,098 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-28 18:51:25,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 18:51:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-28 18:51:25,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 18:51:25,100 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:25,100 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:25,100 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:25,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:25,100 INFO L82 PathProgramCache]: Analyzing trace with hash 601942852, now seen corresponding path program 3 times [2018-11-28 18:51:25,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:25,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:25,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:25,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:25,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:25,284 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 18:51:25,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:25,285 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-11-28 18:51:25,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 18:51:25,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 18:51:25,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:25,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:25,347 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 18:51:25,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:25,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-28 18:51:25,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:51:25,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:51:25,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:51:25,369 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-11-28 18:51:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:25,794 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-28 18:51:25,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:51:25,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-11-28 18:51:25,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:25,796 INFO L225 Difference]: With dead ends: 31 [2018-11-28 18:51:25,796 INFO L226 Difference]: Without dead ends: 27 [2018-11-28 18:51:25,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 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-11-28 18:51:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-28 18:51:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-28 18:51:25,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 18:51:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-28 18:51:25,805 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2018-11-28 18:51:25,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:25,805 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-28 18:51:25,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:51:25,807 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-28 18:51:25,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 18:51:25,808 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:25,808 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:25,808 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:25,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:25,810 INFO L82 PathProgramCache]: Analyzing trace with hash -183109604, now seen corresponding path program 4 times [2018-11-28 18:51:25,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:25,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:25,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:25,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:25,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-28 18:51:25,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:25,967 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-11-28 18:51:25,976 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 18:51:25,994 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 18:51:25,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:25,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-28 18:51:26,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:26,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-28 18:51:26,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:51:26,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:51:26,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:51:26,053 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-11-28 18:51:26,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:26,264 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-28 18:51:26,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 18:51:26,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-28 18:51:26,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:26,268 INFO L225 Difference]: With dead ends: 34 [2018-11-28 18:51:26,268 INFO L226 Difference]: Without dead ends: 30 [2018-11-28 18:51:26,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 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-11-28 18:51:26,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-28 18:51:26,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-28 18:51:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 18:51:26,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-28 18:51:26,277 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2018-11-28 18:51:26,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:26,277 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-28 18:51:26,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:51:26,277 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-28 18:51:26,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 18:51:26,280 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:26,280 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:26,281 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:26,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:26,281 INFO L82 PathProgramCache]: Analyzing trace with hash -155447420, now seen corresponding path program 5 times [2018-11-28 18:51:26,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:26,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:26,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:26,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:26,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:26,491 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-28 18:51:26,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:26,493 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-11-28 18:51:26,509 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 18:51:26,591 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-28 18:51:26,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:26,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:26,639 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-28 18:51:26,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:26,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-28 18:51:26,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:51:26,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:51:26,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:51:26,670 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2018-11-28 18:51:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:26,920 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-28 18:51:26,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:51:26,923 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-11-28 18:51:26,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:26,925 INFO L225 Difference]: With dead ends: 37 [2018-11-28 18:51:26,925 INFO L226 Difference]: Without dead ends: 33 [2018-11-28 18:51:26,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 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-11-28 18:51:26,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-28 18:51:26,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-28 18:51:26,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 18:51:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-28 18:51:26,934 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2018-11-28 18:51:26,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:26,936 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-28 18:51:26,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:51:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-28 18:51:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 18:51:26,938 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:26,938 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:26,939 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:26,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:26,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1716183644, now seen corresponding path program 6 times [2018-11-28 18:51:26,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:26,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:26,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:26,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:26,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:27,138 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-28 18:51:27,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:27,139 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-11-28 18:51:27,149 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 18:51:27,195 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-28 18:51:27,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:27,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-28 18:51:27,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:27,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-28 18:51:27,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:51:27,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:51:27,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:51:27,255 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2018-11-28 18:51:27,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:27,426 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-28 18:51:27,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:51:27,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-11-28 18:51:27,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:27,429 INFO L225 Difference]: With dead ends: 40 [2018-11-28 18:51:27,429 INFO L226 Difference]: Without dead ends: 36 [2018-11-28 18:51:27,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 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-11-28 18:51:27,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-28 18:51:27,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-28 18:51:27,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-28 18:51:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-28 18:51:27,438 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2018-11-28 18:51:27,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:27,439 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-28 18:51:27,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:51:27,439 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-28 18:51:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 18:51:27,440 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:27,440 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:27,442 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:27,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:27,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1079602236, now seen corresponding path program 7 times [2018-11-28 18:51:27,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:27,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:27,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:27,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:27,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:27,661 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-28 18:51:27,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:27,661 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-11-28 18:51:27,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:27,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:27,738 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-28 18:51:27,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:27,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-11-28 18:51:27,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 18:51:27,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 18:51:27,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:51:27,761 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2018-11-28 18:51:28,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:28,116 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-28 18:51:28,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 18:51:28,117 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-11-28 18:51:28,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:28,119 INFO L225 Difference]: With dead ends: 43 [2018-11-28 18:51:28,119 INFO L226 Difference]: Without dead ends: 39 [2018-11-28 18:51:28,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 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-11-28 18:51:28,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-28 18:51:28,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-28 18:51:28,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 18:51:28,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-28 18:51:28,129 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2018-11-28 18:51:28,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:28,129 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-28 18:51:28,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 18:51:28,129 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-28 18:51:28,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-28 18:51:28,131 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:28,131 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:28,132 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:28,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:28,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1035381916, now seen corresponding path program 8 times [2018-11-28 18:51:28,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:28,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:28,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:28,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:51:28,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-28 18:51:28,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:28,811 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-11-28 18:51:28,822 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:51:28,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:51:28,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:28,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-28 18:51:28,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:28,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-28 18:51:28,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 18:51:28,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 18:51:28,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-11-28 18:51:28,918 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2018-11-28 18:51:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:29,143 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-28 18:51:29,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 18:51:29,146 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-11-28 18:51:29,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:29,147 INFO L225 Difference]: With dead ends: 46 [2018-11-28 18:51:29,148 INFO L226 Difference]: Without dead ends: 42 [2018-11-28 18:51:29,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-28 18:51:29,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-28 18:51:29,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-28 18:51:29,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 18:51:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-28 18:51:29,155 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2018-11-28 18:51:29,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:29,155 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-28 18:51:29,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 18:51:29,155 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-28 18:51:29,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 18:51:29,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:29,157 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:29,157 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:29,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:29,157 INFO L82 PathProgramCache]: Analyzing trace with hash 952137732, now seen corresponding path program 9 times [2018-11-28 18:51:29,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:29,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:29,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:29,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:29,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:51:29,333 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-28 18:51:29,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:51:29,334 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-11-28 18:51:29,346 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 18:51:29,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-28 18:51:29,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:51:29,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:51:29,489 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-28 18:51:29,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:51:29,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-11-28 18:51:29,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 18:51:29,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 18:51:29,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:51:29,521 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2018-11-28 18:51:29,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:51:29,773 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-28 18:51:29,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 18:51:29,774 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-11-28 18:51:29,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:51:29,776 INFO L225 Difference]: With dead ends: 49 [2018-11-28 18:51:29,776 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 18:51:29,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-11-28 18:51:29,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 18:51:29,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-28 18:51:29,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 18:51:29,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-28 18:51:29,784 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2018-11-28 18:51:29,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:51:29,784 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-28 18:51:29,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 18:51:29,784 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-28 18:51:29,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 18:51:29,788 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:51:29,788 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:51:29,788 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:51:29,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:51:29,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1540970204, now seen corresponding path program 10 times [2018-11-28 18:51:29,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:51:29,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:51:29,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:29,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:51:29,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:51:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:51:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:51:29,844 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:51:29,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:51:29 BoogieIcfgContainer [2018-11-28 18:51:29,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:51:29,888 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:51:29,888 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:51:29,889 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:51:29,889 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:51:23" (3/4) ... [2018-11-28 18:51:29,893 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:51:29,974 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:51:29,977 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:51:29,978 INFO L168 Benchmark]: Toolchain (without parser) took 7486.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -96.0 MB). Peak memory consumption was 103.2 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:29,982 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:51:29,985 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.26 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:29,986 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.27 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:51:29,988 INFO L168 Benchmark]: Boogie Preprocessor took 24.48 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:51:29,989 INFO L168 Benchmark]: RCFGBuilder took 339.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:29,990 INFO L168 Benchmark]: TraceAbstraction took 6676.82 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: 53.1 MB). Peak memory consumption was 122.3 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:29,990 INFO L168 Benchmark]: Witness Printer took 89.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2018-11-28 18:51:30,001 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.26 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.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 26.27 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.48 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 339.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6676.82 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: 53.1 MB). Peak memory consumption was 122.3 MB. Max. memory is 11.5 GB. * Witness Printer took 89.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 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; VAL [a=10, 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) VAL [a=10, b=0, sum(a, b)=10] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=10, b=0, result=10] [L16] __VERIFIER_error() VAL [a=10, b=0, result=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 6.5s OverallTime, 11 OverallIterations, 11 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 123 SDtfs, 163 SDslu, 555 SDs, 0 SdLazy, 434 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 573 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred 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.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 860 NumberOfCodeBlocks, 855 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 768 ConstructedInterpolants, 0 QuantifiedInterpolants, 87360 SizeOfPredicates, 63 NumberOfNonLiveVariables, 1123 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...