./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/sum_15x0-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/recursive-simple/sum_15x0-2.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 31319b3dce926b7eddaa50d24c240f6870931f21 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-30f4e4a [2019-11-28 00:26:02,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:26:02,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:26:02,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:26:02,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:26:02,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:26:02,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:26:02,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:26:02,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:26:02,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:26:02,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:26:02,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:26:02,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:26:02,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:26:02,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:26:02,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:26:02,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:26:02,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:26:02,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:26:02,754 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:26:02,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:26:02,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:26:02,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:26:02,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:26:02,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:26:02,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:26:02,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:26:02,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:26:02,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:26:02,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:26:02,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:26:02,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:26:02,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:26:02,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:26:02,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:26:02,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:26:02,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:26:02,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:26:02,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:26:02,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:26:02,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:26:02,784 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:26:02,818 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:26:02,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:26:02,824 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:26:02,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:26:02,825 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:26:02,825 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:26:02,825 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:26:02,825 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:26:02,826 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:26:02,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:26:02,826 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:26:02,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:26:02,826 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:26:02,827 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:26:02,827 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:26:02,827 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:26:02,827 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:26:02,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:26:02,828 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:26:02,828 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:26:02,828 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:26:02,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:26:02,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:26:02,829 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:26:02,829 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:26:02,829 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:26:02,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:26:02,830 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:26:02,830 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 31319b3dce926b7eddaa50d24c240f6870931f21 [2019-11-28 00:26:03,140 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:26:03,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:26:03,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:26:03,166 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:26:03,167 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:26:03,168 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_15x0-2.c [2019-11-28 00:26:03,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c268be2c/1dba84beee35419f88ab0d1844b576ce/FLAGe4069f500 [2019-11-28 00:26:03,683 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:26:03,683 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-2.c [2019-11-28 00:26:03,689 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c268be2c/1dba84beee35419f88ab0d1844b576ce/FLAGe4069f500 [2019-11-28 00:26:04,099 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c268be2c/1dba84beee35419f88ab0d1844b576ce [2019-11-28 00:26:04,103 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:26:04,105 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:26:04,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:26:04,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:26:04,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:26:04,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:26:04" (1/1) ... [2019-11-28 00:26:04,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c5318a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:04, skipping insertion in model container [2019-11-28 00:26:04,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:26:04" (1/1) ... [2019-11-28 00:26:04,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:26:04,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:26:04,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:26:04,345 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:26:04,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:26:04,379 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:26:04,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:04 WrapperNode [2019-11-28 00:26:04,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:26:04,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:26:04,381 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:26:04,381 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:26:04,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:04" (1/1) ... [2019-11-28 00:26:04,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:04" (1/1) ... [2019-11-28 00:26:04,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:26:04,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:26:04,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:26:04,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:26:04,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:04" (1/1) ... [2019-11-28 00:26:04,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:04" (1/1) ... [2019-11-28 00:26:04,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:04" (1/1) ... [2019-11-28 00:26:04,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:04" (1/1) ... [2019-11-28 00:26:04,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:04" (1/1) ... [2019-11-28 00:26:04,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:04" (1/1) ... [2019-11-28 00:26:04,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:04" (1/1) ... [2019-11-28 00:26:04,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:26:04,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:26:04,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:26:04,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:26:04,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:04" (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 [2019-11-28 00:26:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:26:04,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:26:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-11-28 00:26:04,564 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-11-28 00:26:04,741 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:26:04,741 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:26:04,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:26:04 BoogieIcfgContainer [2019-11-28 00:26:04,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:26:04,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:26:04,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:26:04,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:26:04,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:26:04" (1/3) ... [2019-11-28 00:26:04,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec8b8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:26:04, skipping insertion in model container [2019-11-28 00:26:04,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:26:04" (2/3) ... [2019-11-28 00:26:04,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec8b8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:26:04, skipping insertion in model container [2019-11-28 00:26:04,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:26:04" (3/3) ... [2019-11-28 00:26:04,751 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_15x0-2.c [2019-11-28 00:26:04,759 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:26:04,765 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:26:04,778 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:26:04,805 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:26:04,805 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:26:04,805 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:26:04,805 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:26:04,806 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:26:04,806 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:26:04,806 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:26:04,806 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:26:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-11-28 00:26:04,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 00:26:04,832 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:04,833 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:04,833 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:04,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:04,839 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-11-28 00:26:04,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:04,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263232993] [2019-11-28 00:26:04,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:26:05,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263232993] [2019-11-28 00:26:05,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:26:05,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 00:26:05,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795451653] [2019-11-28 00:26:05,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 00:26:05,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:05,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 00:26:05,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:26:05,185 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 7 states. [2019-11-28 00:26:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:05,330 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-11-28 00:26:05,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:26:05,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-28 00:26:05,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:05,345 INFO L225 Difference]: With dead ends: 24 [2019-11-28 00:26:05,345 INFO L226 Difference]: Without dead ends: 14 [2019-11-28 00:26:05,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:26:05,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-28 00:26:05,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-28 00:26:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 00:26:05,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-28 00:26:05,392 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-11-28 00:26:05,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:05,392 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-28 00:26:05,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 00:26:05,393 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-28 00:26:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 00:26:05,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:05,394 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:05,395 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:05,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:05,395 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-11-28 00:26:05,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:05,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735382137] [2019-11-28 00:26:05,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:05,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:26:05,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735382137] [2019-11-28 00:26:05,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005944449] [2019-11-28 00:26:05,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:05,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:26:05,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:05,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:26:05,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:05,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-28 00:26:05,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878780619] [2019-11-28 00:26:05,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 00:26:05,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:05,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 00:26:05,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:26:05,689 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 9 states. [2019-11-28 00:26:05,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:05,785 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-28 00:26:05,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:26:05,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-11-28 00:26:05,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:05,787 INFO L225 Difference]: With dead ends: 21 [2019-11-28 00:26:05,787 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 00:26:05,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:26:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 00:26:05,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 00:26:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 00:26:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-28 00:26:05,795 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-11-28 00:26:05,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:05,795 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 00:26:05,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 00:26:05,796 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-11-28 00:26:05,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 00:26:05,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:05,797 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:06,001 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:06,001 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:06,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:06,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-11-28 00:26:06,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:06,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930368118] [2019-11-28 00:26:06,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 00:26:06,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930368118] [2019-11-28 00:26:06,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988559452] [2019-11-28 00:26:06,251 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:06,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:26:06,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:06,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:26:06,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:06,329 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 00:26:06,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:06,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-11-28 00:26:06,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435719253] [2019-11-28 00:26:06,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 00:26:06,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:06,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 00:26:06,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:26:06,333 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2019-11-28 00:26:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:06,454 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-11-28 00:26:06,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:26:06,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-28 00:26:06,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:06,456 INFO L225 Difference]: With dead ends: 24 [2019-11-28 00:26:06,456 INFO L226 Difference]: Without dead ends: 20 [2019-11-28 00:26:06,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:26:06,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-28 00:26:06,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-28 00:26:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 00:26:06,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-28 00:26:06,469 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-11-28 00:26:06,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:06,469 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-28 00:26:06,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 00:26:06,470 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-28 00:26:06,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 00:26:06,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:06,472 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:06,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:06,675 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:06,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:06,676 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-11-28 00:26:06,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:06,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588992123] [2019-11-28 00:26:06,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 00:26:06,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588992123] [2019-11-28 00:26:06,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583105721] [2019-11-28 00:26:06,909 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:06,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 00:26:06,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:06,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 00:26:06,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 00:26:07,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:07,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2019-11-28 00:26:07,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302258829] [2019-11-28 00:26:07,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 00:26:07,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:07,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 00:26:07,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:26:07,016 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 11 states. [2019-11-28 00:26:07,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:07,116 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-28 00:26:07,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:26:07,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-11-28 00:26:07,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:07,118 INFO L225 Difference]: With dead ends: 27 [2019-11-28 00:26:07,119 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 00:26:07,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-28 00:26:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 00:26:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 00:26:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 00:26:07,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-28 00:26:07,135 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-11-28 00:26:07,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:07,135 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-28 00:26:07,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 00:26:07,136 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-28 00:26:07,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:26:07,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:07,138 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:07,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:07,350 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:07,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:07,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-11-28 00:26:07,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:07,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632580750] [2019-11-28 00:26:07,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:07,600 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 00:26:07,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632580750] [2019-11-28 00:26:07,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286539777] [2019-11-28 00:26:07,601 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:07,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:26:07,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:07,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 00:26:07,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:07,677 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 00:26:07,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:07,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2019-11-28 00:26:07,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400417745] [2019-11-28 00:26:07,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:26:07,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:07,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:26:07,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:26:07,683 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-11-28 00:26:07,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:07,811 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-28 00:26:07,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:26:07,811 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-28 00:26:07,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:07,813 INFO L225 Difference]: With dead ends: 30 [2019-11-28 00:26:07,813 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 00:26:07,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-11-28 00:26:07,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 00:26:07,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 00:26:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:26:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-28 00:26:07,821 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-11-28 00:26:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:07,821 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-28 00:26:07,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:26:07,821 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-28 00:26:07,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 00:26:07,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:07,823 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:08,035 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:08,036 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:08,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:08,037 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-11-28 00:26:08,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:08,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961819824] [2019-11-28 00:26:08,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 00:26:08,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961819824] [2019-11-28 00:26:08,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852065921] [2019-11-28 00:26:08,314 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:08,356 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 00:26:08,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:08,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 00:26:08,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 00:26:08,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:08,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2019-11-28 00:26:08,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070752562] [2019-11-28 00:26:08,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 00:26:08,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:08,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 00:26:08,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:26:08,413 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 13 states. [2019-11-28 00:26:08,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:08,543 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-11-28 00:26:08,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 00:26:08,544 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-11-28 00:26:08,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:08,545 INFO L225 Difference]: With dead ends: 33 [2019-11-28 00:26:08,545 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 00:26:08,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-28 00:26:08,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 00:26:08,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-28 00:26:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 00:26:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-28 00:26:08,553 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-11-28 00:26:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:08,553 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-28 00:26:08,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 00:26:08,554 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-28 00:26:08,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 00:26:08,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:08,555 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:08,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:08,760 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:08,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:08,761 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-11-28 00:26:08,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:08,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542723388] [2019-11-28 00:26:08,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-28 00:26:09,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542723388] [2019-11-28 00:26:09,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398421813] [2019-11-28 00:26:09,090 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:09,164 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-28 00:26:09,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:09,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 00:26:09,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:09,254 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-28 00:26:09,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:09,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2019-11-28 00:26:09,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628326312] [2019-11-28 00:26:09,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 00:26:09,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:09,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 00:26:09,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:26:09,258 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 14 states. [2019-11-28 00:26:09,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:09,397 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-11-28 00:26:09,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 00:26:09,398 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2019-11-28 00:26:09,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:09,399 INFO L225 Difference]: With dead ends: 36 [2019-11-28 00:26:09,399 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 00:26:09,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2019-11-28 00:26:09,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 00:26:09,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-28 00:26:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 00:26:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-11-28 00:26:09,406 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-11-28 00:26:09,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:09,407 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-11-28 00:26:09,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 00:26:09,407 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-11-28 00:26:09,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 00:26:09,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:09,409 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:09,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:09,613 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:09,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:09,614 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-11-28 00:26:09,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:09,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174772777] [2019-11-28 00:26:09,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,872 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-28 00:26:09,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174772777] [2019-11-28 00:26:09,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226040470] [2019-11-28 00:26:09,873 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:09,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 00:26:09,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-28 00:26:09,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:09,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2019-11-28 00:26:09,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517506546] [2019-11-28 00:26:09,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 00:26:09,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:09,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 00:26:09,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-11-28 00:26:09,969 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 15 states. [2019-11-28 00:26:10,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:10,125 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-11-28 00:26:10,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 00:26:10,126 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2019-11-28 00:26:10,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:10,127 INFO L225 Difference]: With dead ends: 39 [2019-11-28 00:26:10,127 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 00:26:10,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2019-11-28 00:26:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 00:26:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-28 00:26:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 00:26:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-11-28 00:26:10,137 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-11-28 00:26:10,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:10,138 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-11-28 00:26:10,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 00:26:10,138 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-11-28 00:26:10,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-28 00:26:10,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:10,141 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:10,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:10,345 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:10,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:10,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-11-28 00:26:10,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:10,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115787568] [2019-11-28 00:26:10,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:10,620 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-28 00:26:10,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115787568] [2019-11-28 00:26:10,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912141796] [2019-11-28 00:26:10,622 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:10,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:26:10,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:10,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 00:26:10,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:10,723 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-28 00:26:10,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:10,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 16 [2019-11-28 00:26:10,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765668948] [2019-11-28 00:26:10,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 00:26:10,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:10,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 00:26:10,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-11-28 00:26:10,725 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 16 states. [2019-11-28 00:26:10,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:10,886 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-11-28 00:26:10,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 00:26:10,887 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2019-11-28 00:26:10,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:10,888 INFO L225 Difference]: With dead ends: 42 [2019-11-28 00:26:10,889 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 00:26:10,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2019-11-28 00:26:10,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 00:26:10,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-28 00:26:10,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 00:26:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-28 00:26:10,896 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-11-28 00:26:10,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:10,897 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-28 00:26:10,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 00:26:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-28 00:26:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 00:26:10,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:10,899 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:11,107 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:11,107 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:11,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:11,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-11-28 00:26:11,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:11,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622153572] [2019-11-28 00:26:11,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:11,463 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-28 00:26:11,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622153572] [2019-11-28 00:26:11,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270711069] [2019-11-28 00:26:11,464 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:11,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-28 00:26:11,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:11,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 00:26:11,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:11,577 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-28 00:26:11,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:11,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 17 [2019-11-28 00:26:11,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584512430] [2019-11-28 00:26:11,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 00:26:11,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:11,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 00:26:11,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-11-28 00:26:11,581 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 17 states. [2019-11-28 00:26:11,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:11,795 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-11-28 00:26:11,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 00:26:11,796 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2019-11-28 00:26:11,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:11,797 INFO L225 Difference]: With dead ends: 45 [2019-11-28 00:26:11,797 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 00:26:11,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=485, Unknown=0, NotChecked=0, Total=702 [2019-11-28 00:26:11,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 00:26:11,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-28 00:26:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 00:26:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-11-28 00:26:11,805 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-11-28 00:26:11,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:11,805 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-11-28 00:26:11,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 00:26:11,805 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-11-28 00:26:11,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 00:26:11,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:11,808 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:12,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:12,010 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:12,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:12,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-11-28 00:26:12,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:12,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82511612] [2019-11-28 00:26:12,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-28 00:26:12,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82511612] [2019-11-28 00:26:12,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859986813] [2019-11-28 00:26:12,446 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:12,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:26:12,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:12,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 00:26:12,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-28 00:26:12,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:12,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 18 [2019-11-28 00:26:12,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435191750] [2019-11-28 00:26:12,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 00:26:12,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:12,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 00:26:12,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-11-28 00:26:12,568 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 18 states. [2019-11-28 00:26:12,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:12,804 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-11-28 00:26:12,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 00:26:12,805 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2019-11-28 00:26:12,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:12,807 INFO L225 Difference]: With dead ends: 48 [2019-11-28 00:26:12,807 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 00:26:12,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2019-11-28 00:26:12,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 00:26:12,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-28 00:26:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 00:26:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-11-28 00:26:12,825 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-11-28 00:26:12,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:12,827 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-11-28 00:26:12,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 00:26:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-11-28 00:26:12,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-28 00:26:12,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:12,833 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:13,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:13,039 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:13,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:13,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-11-28 00:26:13,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:13,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973833180] [2019-11-28 00:26:13,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-28 00:26:13,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973833180] [2019-11-28 00:26:13,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200506017] [2019-11-28 00:26:13,422 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:13,475 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-28 00:26:13,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:13,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 00:26:13,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:13,513 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-28 00:26:13,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:13,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 19 [2019-11-28 00:26:13,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616583028] [2019-11-28 00:26:13,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 00:26:13,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:13,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 00:26:13,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-11-28 00:26:13,515 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 19 states. [2019-11-28 00:26:13,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:13,711 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-11-28 00:26:13,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 00:26:13,712 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2019-11-28 00:26:13,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:13,714 INFO L225 Difference]: With dead ends: 51 [2019-11-28 00:26:13,714 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 00:26:13,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=294, Invalid=636, Unknown=0, NotChecked=0, Total=930 [2019-11-28 00:26:13,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 00:26:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 00:26:13,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 00:26:13,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-11-28 00:26:13,721 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-11-28 00:26:13,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:13,722 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-11-28 00:26:13,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 00:26:13,722 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-11-28 00:26:13,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-28 00:26:13,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:13,723 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:13,927 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:13,927 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:13,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:13,928 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-11-28 00:26:13,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:13,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888256737] [2019-11-28 00:26:13,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:14,525 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-28 00:26:14,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888256737] [2019-11-28 00:26:14,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141057007] [2019-11-28 00:26:14,527 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:14,606 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-11-28 00:26:14,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:14,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 00:26:14,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-28 00:26:14,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:14,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 20 [2019-11-28 00:26:14,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254452932] [2019-11-28 00:26:14,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 00:26:14,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:14,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 00:26:14,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-28 00:26:14,676 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 20 states. [2019-11-28 00:26:14,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:14,920 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-28 00:26:14,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 00:26:14,921 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 81 [2019-11-28 00:26:14,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:14,922 INFO L225 Difference]: With dead ends: 54 [2019-11-28 00:26:14,922 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 00:26:14,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=337, Invalid=719, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 00:26:14,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 00:26:14,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-28 00:26:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 00:26:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-11-28 00:26:14,936 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-11-28 00:26:14,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:14,937 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-11-28 00:26:14,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 00:26:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-11-28 00:26:14,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-28 00:26:14,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:14,942 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:15,146 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:15,146 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:15,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:15,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-11-28 00:26:15,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:15,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590905218] [2019-11-28 00:26:15,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,728 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-28 00:26:15,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590905218] [2019-11-28 00:26:15,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509830337] [2019-11-28 00:26:15,729 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:15,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 00:26:15,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:15,828 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-28 00:26:15,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:15,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 21 [2019-11-28 00:26:15,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334132162] [2019-11-28 00:26:15,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 00:26:15,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:15,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 00:26:15,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2019-11-28 00:26:15,833 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 21 states. [2019-11-28 00:26:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:16,068 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-11-28 00:26:16,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 00:26:16,068 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2019-11-28 00:26:16,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:16,070 INFO L225 Difference]: With dead ends: 57 [2019-11-28 00:26:16,070 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 00:26:16,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=383, Invalid=807, Unknown=0, NotChecked=0, Total=1190 [2019-11-28 00:26:16,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 00:26:16,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-28 00:26:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 00:26:16,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-11-28 00:26:16,077 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-11-28 00:26:16,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:16,078 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-11-28 00:26:16,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 00:26:16,078 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-11-28 00:26:16,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-28 00:26:16,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:16,080 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:16,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:16,284 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:16,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:16,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-11-28 00:26:16,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:16,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086103151] [2019-11-28 00:26:16,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:26:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-28 00:26:16,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086103151] [2019-11-28 00:26:16,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810879162] [2019-11-28 00:26:16,823 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:16,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:26:16,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:26:16,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 00:26:16,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:26:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-28 00:26:16,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:26:16,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 22 [2019-11-28 00:26:16,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849509773] [2019-11-28 00:26:16,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-28 00:26:16,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:26:16,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 00:26:16,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2019-11-28 00:26:16,972 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 22 states. [2019-11-28 00:26:17,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:26:17,266 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-28 00:26:17,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 00:26:17,267 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2019-11-28 00:26:17,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:26:17,268 INFO L225 Difference]: With dead ends: 60 [2019-11-28 00:26:17,268 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 00:26:17,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=432, Invalid=900, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 00:26:17,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 00:26:17,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-28 00:26:17,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 00:26:17,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-11-28 00:26:17,279 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-11-28 00:26:17,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:26:17,280 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-11-28 00:26:17,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-28 00:26:17,280 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-11-28 00:26:17,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-28 00:26:17,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:26:17,285 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:26:17,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:26:17,489 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:26:17,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:26:17,489 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-11-28 00:26:17,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:26:17,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780608150] [2019-11-28 00:26:17,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:26:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:26:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:26:17,622 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:26:17,623 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:26:17,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:26:17 BoogieIcfgContainer [2019-11-28 00:26:17,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:26:17,720 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:26:17,720 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:26:17,720 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:26:17,721 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:26:04" (3/4) ... [2019-11-28 00:26:17,724 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:26:17,849 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:26:17,849 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:26:17,852 INFO L168 Benchmark]: Toolchain (without parser) took 13747.21 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 374.9 MB). Free memory was 961.7 MB in the beginning and 1.3 GB in the end (delta: -361.2 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:17,853 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:26:17,853 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.60 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:17,853 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.18 ms. Allocated memory is still 1.0 GB. Free memory is still 951.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:26:17,854 INFO L168 Benchmark]: Boogie Preprocessor took 81.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:17,854 INFO L168 Benchmark]: RCFGBuilder took 245.54 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:17,855 INFO L168 Benchmark]: TraceAbstraction took 12975.19 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 244.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -227.3 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:17,855 INFO L168 Benchmark]: Witness Printer took 130.02 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:26:17,857 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.60 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 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 34.18 ms. Allocated memory is still 1.0 GB. Free memory is still 951.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 245.54 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12975.19 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 244.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -227.3 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * Witness Printer took 130.02 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 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 = 15; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=15, \old(n)=0, \result=15, m=15, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1, m=14, n=1, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2, m=13, n=2, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3, m=12, n=3, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4, m=11, n=4, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5, m=10, n=5, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6, m=9, n=6, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7, m=8, n=7, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8, m=7, n=8, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9, m=6, n=9, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10, m=5, n=10, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11, m=4, n=11, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12, m=3, n=12, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13, m=2, n=13, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14, m=1, n=14, sum(n - 1, m + 1)=15] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=15, m=0, n=15, sum(n - 1, m + 1)=15] [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. Result: UNSAFE, OverallTime: 12.8s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 122 SDtfs, 447 SDslu, 647 SDs, 0 SdLazy, 830 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1282 GetRequests, 968 SyntacticMatches, 0 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1620 NumberOfCodeBlocks, 1620 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 1492 ConstructedInterpolants, 0 QuantifiedInterpolants, 254632 SizeOfPredicates, 133 NumberOfNonLiveVariables, 2296 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 29 InterpolantComputations, 1 PerfectInterpolantSequences, 3150/6300 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...