./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursive/EvenOdd01-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a77b9e67-f354-495e-90bb-88a0085cc421/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a77b9e67-f354-495e-90bb-88a0085cc421/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a77b9e67-f354-495e-90bb-88a0085cc421/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a77b9e67-f354-495e-90bb-88a0085cc421/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/EvenOdd01-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a77b9e67-f354-495e-90bb-88a0085cc421/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a77b9e67-f354-495e-90bb-88a0085cc421/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bec5669c6fe02e51518958076fea4487ada345cf .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:36:04,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:36:04,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:36:04,675 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:36:04,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:36:04,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:36:04,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:36:04,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:36:04,681 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:36:04,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:36:04,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:36:04,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:36:04,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:36:04,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:36:04,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:36:04,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:36:04,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:36:04,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:36:04,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:36:04,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:36:04,691 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:36:04,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:36:04,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:36:04,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:36:04,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:36:04,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:36:04,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:36:04,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:36:04,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:36:04,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:36:04,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:36:04,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:36:04,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:36:04,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:36:04,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:36:04,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:36:04,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:36:04,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:36:04,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:36:04,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:36:04,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:36:04,703 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a77b9e67-f354-495e-90bb-88a0085cc421/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2019-12-07 14:36:04,715 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:36:04,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:36:04,716 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:36:04,716 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:36:04,717 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:36:04,717 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:36:04,717 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:36:04,717 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:36:04,717 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:36:04,717 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:36:04,718 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:36:04,718 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:36:04,718 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:36:04,718 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:36:04,718 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:36:04,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:36:04,719 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:36:04,719 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 14:36:04,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:36:04,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:36:04,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:36:04,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:36:04,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:36:04,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:36:04,720 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 14:36:04,720 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:36:04,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:36:04,721 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:36:04,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:36:04,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:36:04,721 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:36:04,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:36:04,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:36:04,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:36:04,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:36:04,722 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:36:04,722 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:36:04,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:36:04,723 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:36:04,723 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:36:04,723 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:36:04,723 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_a77b9e67-f354-495e-90bb-88a0085cc421/bin/utaipan 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> bec5669c6fe02e51518958076fea4487ada345cf [2019-12-07 14:36:04,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:36:04,833 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:36:04,835 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:36:04,837 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:36:04,837 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:36:04,838 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a77b9e67-f354-495e-90bb-88a0085cc421/bin/utaipan/../../sv-benchmarks/c/recursive/EvenOdd01-1.c [2019-12-07 14:36:04,879 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a77b9e67-f354-495e-90bb-88a0085cc421/bin/utaipan/data/595a5e88b/1601dbdc25e942299662f2d457f5e14b/FLAGd2d00afd0 [2019-12-07 14:36:05,290 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:36:05,290 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a77b9e67-f354-495e-90bb-88a0085cc421/sv-benchmarks/c/recursive/EvenOdd01-1.c [2019-12-07 14:36:05,295 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a77b9e67-f354-495e-90bb-88a0085cc421/bin/utaipan/data/595a5e88b/1601dbdc25e942299662f2d457f5e14b/FLAGd2d00afd0 [2019-12-07 14:36:05,304 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a77b9e67-f354-495e-90bb-88a0085cc421/bin/utaipan/data/595a5e88b/1601dbdc25e942299662f2d457f5e14b [2019-12-07 14:36:05,306 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:36:05,307 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:36:05,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:36:05,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:36:05,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:36:05,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:36:05" (1/1) ... [2019-12-07 14:36:05,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19876906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:05, skipping insertion in model container [2019-12-07 14:36:05,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:36:05" (1/1) ... [2019-12-07 14:36:05,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:36:05,327 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:36:05,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:36:05,429 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:36:05,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:36:05,480 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:36:05,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:05 WrapperNode [2019-12-07 14:36:05,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:36:05,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:36:05,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:36:05,481 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:36:05,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:05" (1/1) ... [2019-12-07 14:36:05,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:05" (1/1) ... [2019-12-07 14:36:05,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:36:05,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:36:05,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:36:05,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:36:05,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:05" (1/1) ... [2019-12-07 14:36:05,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:05" (1/1) ... [2019-12-07 14:36:05,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:05" (1/1) ... [2019-12-07 14:36:05,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:05" (1/1) ... [2019-12-07 14:36:05,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:05" (1/1) ... [2019-12-07 14:36:05,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:05" (1/1) ... [2019-12-07 14:36:05,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:05" (1/1) ... [2019-12-07 14:36:05,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:36:05,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:36:05,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:36:05,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:36:05,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a77b9e67-f354-495e-90bb-88a0085cc421/bin/utaipan/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-12-07 14:36:05,554 INFO L130 BoogieDeclarations]: Found specification of procedure isEven [2019-12-07 14:36:05,554 INFO L138 BoogieDeclarations]: Found implementation of procedure isEven [2019-12-07 14:36:05,554 INFO L130 BoogieDeclarations]: Found specification of procedure isOdd [2019-12-07 14:36:05,554 INFO L138 BoogieDeclarations]: Found implementation of procedure isOdd [2019-12-07 14:36:05,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:36:05,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:36:05,693 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:36:05,693 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 14:36:05,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:36:05 BoogieIcfgContainer [2019-12-07 14:36:05,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:36:05,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:36:05,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:36:05,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:36:05,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:36:05" (1/3) ... [2019-12-07 14:36:05,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e21a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:36:05, skipping insertion in model container [2019-12-07 14:36:05,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:05" (2/3) ... [2019-12-07 14:36:05,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e21a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:36:05, skipping insertion in model container [2019-12-07 14:36:05,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:36:05" (3/3) ... [2019-12-07 14:36:05,698 INFO L109 eAbstractionObserver]: Analyzing ICFG EvenOdd01-1.c [2019-12-07 14:36:05,705 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:36:05,709 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-12-07 14:36:05,716 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-07 14:36:05,730 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:36:05,731 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:36:05,731 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:36:05,731 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:36:05,731 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:36:05,731 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:36:05,731 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:36:05,731 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:36:05,742 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-12-07 14:36:05,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 14:36:05,746 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:05,746 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:05,747 INFO L410 AbstractCegarLoop]: === Iteration 1 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:36:05,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:05,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2104858774, now seen corresponding path program 1 times [2019-12-07 14:36:05,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:36:05,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357947331] [2019-12-07 14:36:05,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:05,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357947331] [2019-12-07 14:36:05,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:05,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:36:05,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303597913] [2019-12-07 14:36:05,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:36:05,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:36:05,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:36:05,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:05,873 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2019-12-07 14:36:05,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:05,945 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-12-07 14:36:05,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:36:05,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-07 14:36:05,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:05,953 INFO L225 Difference]: With dead ends: 41 [2019-12-07 14:36:05,953 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 14:36:05,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:36:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 14:36:05,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-12-07 14:36:05,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 14:36:05,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-12-07 14:36:05,979 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 7 [2019-12-07 14:36:05,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:05,979 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-12-07 14:36:05,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:36:05,979 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-12-07 14:36:05,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 14:36:05,979 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:05,979 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:05,980 INFO L410 AbstractCegarLoop]: === Iteration 2 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:36:05,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:05,980 INFO L82 PathProgramCache]: Analyzing trace with hash 826112612, now seen corresponding path program 1 times [2019-12-07 14:36:05,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:36:05,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429894134] [2019-12-07 14:36:05,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:06,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:06,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429894134] [2019-12-07 14:36:06,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:06,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:06,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436366999] [2019-12-07 14:36:06,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:36:06,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:36:06,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:36:06,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:06,003 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 5 states. [2019-12-07 14:36:06,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:06,026 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-12-07 14:36:06,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:36:06,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-12-07 14:36:06,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:06,027 INFO L225 Difference]: With dead ends: 26 [2019-12-07 14:36:06,027 INFO L226 Difference]: Without dead ends: 25 [2019-12-07 14:36:06,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:36:06,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-12-07 14:36:06,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-12-07 14:36:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 14:36:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-12-07 14:36:06,032 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 8 [2019-12-07 14:36:06,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:06,032 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-12-07 14:36:06,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:36:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-12-07 14:36:06,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:36:06,032 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:06,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:06,033 INFO L410 AbstractCegarLoop]: === Iteration 3 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:36:06,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:06,033 INFO L82 PathProgramCache]: Analyzing trace with hash -345822603, now seen corresponding path program 1 times [2019-12-07 14:36:06,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:36:06,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183358325] [2019-12-07 14:36:06,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:06,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183358325] [2019-12-07 14:36:06,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:06,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:36:06,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508828794] [2019-12-07 14:36:06,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:36:06,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:36:06,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:36:06,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:36:06,078 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 7 states. [2019-12-07 14:36:06,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:06,126 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-12-07 14:36:06,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:36:06,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-12-07 14:36:06,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:06,127 INFO L225 Difference]: With dead ends: 24 [2019-12-07 14:36:06,127 INFO L226 Difference]: Without dead ends: 22 [2019-12-07 14:36:06,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:36:06,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-12-07 14:36:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-12-07 14:36:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 14:36:06,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-12-07 14:36:06,131 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 13 [2019-12-07 14:36:06,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:06,131 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-12-07 14:36:06,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:36:06,131 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-12-07 14:36:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:36:06,131 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:06,131 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:06,132 INFO L410 AbstractCegarLoop]: === Iteration 4 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:36:06,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:06,132 INFO L82 PathProgramCache]: Analyzing trace with hash -2130566059, now seen corresponding path program 1 times [2019-12-07 14:36:06,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:36:06,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789636613] [2019-12-07 14:36:06,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:06,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789636613] [2019-12-07 14:36:06,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:06,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:36:06,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829709007] [2019-12-07 14:36:06,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:36:06,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:36:06,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:36:06,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:36:06,172 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 7 states. [2019-12-07 14:36:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:06,218 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-12-07 14:36:06,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:36:06,218 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-07 14:36:06,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:06,219 INFO L225 Difference]: With dead ends: 30 [2019-12-07 14:36:06,219 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 14:36:06,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:36:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 14:36:06,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-12-07 14:36:06,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 14:36:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-12-07 14:36:06,223 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 14 [2019-12-07 14:36:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:06,223 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-12-07 14:36:06,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:36:06,223 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-12-07 14:36:06,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 14:36:06,224 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:06,224 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:06,224 INFO L410 AbstractCegarLoop]: === Iteration 5 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:36:06,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:06,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1256120232, now seen corresponding path program 1 times [2019-12-07 14:36:06,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:36:06,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330001091] [2019-12-07 14:36:06,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:06,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330001091] [2019-12-07 14:36:06,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671107957] [2019-12-07 14:36:06,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a77b9e67-f354-495e-90bb-88a0085cc421/bin/utaipan/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-12-07 14:36:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:06,299 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 14:36:06,303 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:36:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:06,321 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:36:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:06,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1387780095] [2019-12-07 14:36:06,408 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 14:36:06,408 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:36:06,412 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:36:06,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:36:06,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-12-07 14:36:06,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709270864] [2019-12-07 14:36:06,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 14:36:06,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:36:06,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 14:36:06,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:36:06,415 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 16 states. [2019-12-07 14:36:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:06,517 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-12-07 14:36:06,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 14:36:06,517 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2019-12-07 14:36:06,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:06,518 INFO L225 Difference]: With dead ends: 49 [2019-12-07 14:36:06,518 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 14:36:06,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2019-12-07 14:36:06,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 14:36:06,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-12-07 14:36:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 14:36:06,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-12-07 14:36:06,523 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 20 [2019-12-07 14:36:06,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:06,524 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-12-07 14:36:06,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 14:36:06,524 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-12-07 14:36:06,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 14:36:06,525 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:06,525 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-12-07 14:36:06,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:36:06,726 INFO L410 AbstractCegarLoop]: === Iteration 6 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:36:06,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:06,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1724912701, now seen corresponding path program 1 times [2019-12-07 14:36:06,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:36:06,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479305795] [2019-12-07 14:36:06,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:06,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479305795] [2019-12-07 14:36:06,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366703954] [2019-12-07 14:36:06,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a77b9e67-f354-495e-90bb-88a0085cc421/bin/utaipan/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-12-07 14:36:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:06,991 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 14:36:06,993 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:36:07,007 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:07,007 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:36:07,155 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:07,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [10019875] [2019-12-07 14:36:07,157 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 14:36:07,158 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:36:07,158 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:36:07,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:36:07,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-12-07 14:36:07,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737921925] [2019-12-07 14:36:07,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 14:36:07,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:36:07,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 14:36:07,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2019-12-07 14:36:07,161 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 28 states. [2019-12-07 14:36:07,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:07,428 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2019-12-07 14:36:07,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 14:36:07,428 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 38 [2019-12-07 14:36:07,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:07,429 INFO L225 Difference]: With dead ends: 91 [2019-12-07 14:36:07,429 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 14:36:07,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 14:36:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 14:36:07,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-12-07 14:36:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 14:36:07,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-12-07 14:36:07,438 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 38 [2019-12-07 14:36:07,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:07,438 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-12-07 14:36:07,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 14:36:07,439 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-12-07 14:36:07,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 14:36:07,441 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:07,441 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-12-07 14:36:07,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:36:07,642 INFO L410 AbstractCegarLoop]: === Iteration 7 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:36:07,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:07,642 INFO L82 PathProgramCache]: Analyzing trace with hash -737162212, now seen corresponding path program 2 times [2019-12-07 14:36:07,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:36:07,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984595126] [2019-12-07 14:36:07,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:07,965 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:07,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984595126] [2019-12-07 14:36:07,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749603474] [2019-12-07 14:36:07,966 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a77b9e67-f354-495e-90bb-88a0085cc421/bin/utaipan/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-12-07 14:36:07,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-12-07 14:36:07,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:36:07,995 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 14:36:07,998 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:36:08,015 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:08,015 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:36:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:08,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1556953917] [2019-12-07 14:36:08,461 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 14:36:08,461 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:36:08,462 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:36:08,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:36:08,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-12-07 14:36:08,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326129246] [2019-12-07 14:36:08,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-12-07 14:36:08,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:36:08,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-12-07 14:36:08,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=2656, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 14:36:08,465 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 56 states. [2019-12-07 14:36:09,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:09,002 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2019-12-07 14:36:09,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-07 14:36:09,002 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 80 [2019-12-07 14:36:09,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:09,004 INFO L225 Difference]: With dead ends: 169 [2019-12-07 14:36:09,004 INFO L226 Difference]: Without dead ends: 167 [2019-12-07 14:36:09,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=970, Invalid=5510, Unknown=0, NotChecked=0, Total=6480 [2019-12-07 14:36:09,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-12-07 14:36:09,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-12-07 14:36:09,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-12-07 14:36:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-12-07 14:36:09,018 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 80 [2019-12-07 14:36:09,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:09,019 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-12-07 14:36:09,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-12-07 14:36:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-12-07 14:36:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 14:36:09,021 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:09,021 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 1, 1, 1, 1] [2019-12-07 14:36:09,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:36:09,222 INFO L410 AbstractCegarLoop]: === Iteration 8 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:36:09,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:09,222 INFO L82 PathProgramCache]: Analyzing trace with hash -321291323, now seen corresponding path program 2 times [2019-12-07 14:36:09,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:36:09,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178857304] [2019-12-07 14:36:09,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:10,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178857304] [2019-12-07 14:36:10,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983735585] [2019-12-07 14:36:10,015 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a77b9e67-f354-495e-90bb-88a0085cc421/bin/utaipan/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-12-07 14:36:10,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-12-07 14:36:10,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:36:10,059 INFO L264 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 55 conjunts are in the unsatisfiable core [2019-12-07 14:36:10,064 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:36:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:11,153 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:36:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:12,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [938089203] [2019-12-07 14:36:12,714 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 14:36:12,714 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:36:12,714 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:36:12,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:36:12,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 55, 54] total 158 [2019-12-07 14:36:12,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895668977] [2019-12-07 14:36:12,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 159 states [2019-12-07 14:36:12,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:36:12,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2019-12-07 14:36:12,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3242, Invalid=21880, Unknown=0, NotChecked=0, Total=25122 [2019-12-07 14:36:12,724 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 159 states. [2019-12-07 14:36:14,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:14,420 INFO L93 Difference]: Finished difference Result 331 states and 356 transitions. [2019-12-07 14:36:14,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-12-07 14:36:14,421 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 158 [2019-12-07 14:36:14,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:14,424 INFO L225 Difference]: With dead ends: 331 [2019-12-07 14:36:14,424 INFO L226 Difference]: Without dead ends: 329 [2019-12-07 14:36:14,432 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20385 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5867, Invalid=38865, Unknown=0, NotChecked=0, Total=44732 [2019-12-07 14:36:14,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-12-07 14:36:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 328. [2019-12-07 14:36:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-07 14:36:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2019-12-07 14:36:14,463 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 158 [2019-12-07 14:36:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:14,463 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 328 transitions. [2019-12-07 14:36:14,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 159 states. [2019-12-07 14:36:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 328 transitions. [2019-12-07 14:36:14,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-12-07 14:36:14,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:14,468 INFO L410 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1] [2019-12-07 14:36:14,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:36:14,670 INFO L410 AbstractCegarLoop]: === Iteration 9 === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 14:36:14,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:14,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1499483948, now seen corresponding path program 3 times [2019-12-07 14:36:14,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:36:14,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130611612] [2019-12-07 14:36:14,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:17,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:17,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130611612] [2019-12-07 14:36:17,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952862675] [2019-12-07 14:36:17,265 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a77b9e67-f354-495e-90bb-88a0085cc421/bin/utaipan/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-12-07 14:36:17,331 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 14:36:17,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 14:36:17,335 INFO L264 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 160 conjunts are in the unsatisfiable core [2019-12-07 14:36:17,343 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:36:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 3952 trivial. 0 not checked. [2019-12-07 14:36:17,617 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:36:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:26,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [968584213] [2019-12-07 14:36:26,124 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 14:36:26,125 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 14:36:26,125 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 14:36:26,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 14:36:26,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 8, 108] total 219 [2019-12-07 14:36:26,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324909646] [2019-12-07 14:36:26,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 220 states [2019-12-07 14:36:26,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:36:26,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 220 interpolants. [2019-12-07 14:36:26,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6165, Invalid=42015, Unknown=0, NotChecked=0, Total=48180 [2019-12-07 14:36:26,129 INFO L87 Difference]: Start difference. First operand 328 states and 328 transitions. Second operand 220 states. [2019-12-07 14:36:26,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:26,266 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2019-12-07 14:36:26,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:36:26,267 INFO L78 Accepts]: Start accepts. Automaton has 220 states. Word has length 320 [2019-12-07 14:36:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:26,268 INFO L225 Difference]: With dead ends: 328 [2019-12-07 14:36:26,268 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 14:36:26,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 476 SyntacticMatches, 52 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30016 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=6609, Invalid=43343, Unknown=0, NotChecked=0, Total=49952 [2019-12-07 14:36:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 14:36:26,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 14:36:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 14:36:26,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 14:36:26,271 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 320 [2019-12-07 14:36:26,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:26,271 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:36:26,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 220 states. [2019-12-07 14:36:26,271 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 14:36:26,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 14:36:26,472 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:36:26,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 14:36:26,804 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 12 [2019-12-07 14:36:26,988 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 17 [2019-12-07 14:36:26,992 INFO L246 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2019-12-07 14:36:26,992 INFO L246 CegarLoopResult]: For program point L32-1(line 32) no Hoare annotation was computed. [2019-12-07 14:36:26,992 INFO L242 CegarLoopResult]: At program point L32-2(line 32) the Hoare annotation is: (or (not (<= 1 |isEven_#in~n|)) (not (<= |isEven_#in~n| 2147483646)) (and (<= 1 isEven_~n) (<= isEven_~n 2147483646))) [2019-12-07 14:36:26,992 INFO L246 CegarLoopResult]: For program point L29(lines 29 33) no Hoare annotation was computed. [2019-12-07 14:36:26,992 INFO L246 CegarLoopResult]: For program point L32-3(line 32) no Hoare annotation was computed. [2019-12-07 14:36:26,992 INFO L246 CegarLoopResult]: For program point L27(lines 27 33) no Hoare annotation was computed. [2019-12-07 14:36:26,992 INFO L246 CegarLoopResult]: For program point isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2019-12-07 14:36:26,992 INFO L249 CegarLoopResult]: At program point isEvenENTRY(lines 26 34) the Hoare annotation is: true [2019-12-07 14:36:26,993 INFO L246 CegarLoopResult]: For program point isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 32) no Hoare annotation was computed. [2019-12-07 14:36:26,993 INFO L246 CegarLoopResult]: For program point isEvenEXIT(lines 26 34) no Hoare annotation was computed. [2019-12-07 14:36:26,993 INFO L246 CegarLoopResult]: For program point isEvenFINAL(lines 26 34) no Hoare annotation was computed. [2019-12-07 14:36:26,993 INFO L246 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2019-12-07 14:36:26,993 INFO L246 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2019-12-07 14:36:26,993 INFO L242 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (or (not (<= |isOdd_#in~n| 2147483647)) (and (not (= isOdd_~n 0)) (<= isOdd_~n 2147483647) (<= 0 isOdd_~n) (not (= isOdd_~n 1))) (not (<= 0 |isOdd_#in~n|))) [2019-12-07 14:36:26,993 INFO L246 CegarLoopResult]: For program point L19(lines 19 23) no Hoare annotation was computed. [2019-12-07 14:36:26,993 INFO L246 CegarLoopResult]: For program point L22-3(line 22) no Hoare annotation was computed. [2019-12-07 14:36:26,993 INFO L246 CegarLoopResult]: For program point L17(lines 17 23) no Hoare annotation was computed. [2019-12-07 14:36:26,993 INFO L246 CegarLoopResult]: For program point isOddFINAL(lines 16 24) no Hoare annotation was computed. [2019-12-07 14:36:26,993 INFO L246 CegarLoopResult]: For program point isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-12-07 14:36:26,993 INFO L246 CegarLoopResult]: For program point isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-12-07 14:36:26,993 INFO L249 CegarLoopResult]: At program point isOddENTRY(lines 16 24) the Hoare annotation is: true [2019-12-07 14:36:26,993 INFO L246 CegarLoopResult]: For program point isOddEXIT(lines 16 24) no Hoare annotation was computed. [2019-12-07 14:36:26,993 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 14:36:26,993 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 14:36:26,994 INFO L242 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (<= ULTIMATE.start_main_~n~0 2147483647) (<= 0 ULTIMATE.start_main_~n~0)) [2019-12-07 14:36:26,994 INFO L246 CegarLoopResult]: For program point L42-1(line 42) no Hoare annotation was computed. [2019-12-07 14:36:26,994 INFO L246 CegarLoopResult]: For program point L39(lines 39 41) no Hoare annotation was computed. [2019-12-07 14:36:26,994 INFO L242 CegarLoopResult]: At program point L37(lines 37 49) the Hoare annotation is: (<= ULTIMATE.start_main_~n~0 2147483647) [2019-12-07 14:36:27,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:36:27 BoogieIcfgContainer [2019-12-07 14:36:27,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:36:27,004 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:36:27,004 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:36:27,004 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:36:27,005 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:36:05" (3/4) ... [2019-12-07 14:36:27,007 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 14:36:27,010 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isEven [2019-12-07 14:36:27,010 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isOdd [2019-12-07 14:36:27,013 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-12-07 14:36:27,013 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 14:36:27,044 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a77b9e67-f354-495e-90bb-88a0085cc421/bin/utaipan/witness.graphml [2019-12-07 14:36:27,044 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:36:27,045 INFO L168 Benchmark]: Toolchain (without parser) took 21738.06 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 388.5 MB). Free memory was 945.3 MB in the beginning and 1.2 GB in the end (delta: -208.7 MB). Peak memory consumption was 179.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:36:27,045 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:36:27,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:36:27,046 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:36:27,046 INFO L168 Benchmark]: Boogie Preprocessor took 12.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:36:27,046 INFO L168 Benchmark]: RCFGBuilder took 180.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:36:27,047 INFO L168 Benchmark]: TraceAbstraction took 21309.42 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 287.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -84.4 MB). Peak memory consumption was 202.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:36:27,047 INFO L168 Benchmark]: Witness Printer took 39.78 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:36:27,049 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 173.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 180.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21309.42 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 287.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -84.4 MB). Peak memory consumption was 202.9 MB. Max. memory is 11.5 GB. * Witness Printer took 39.78 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: n <= 2147483647 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 4 error locations. Result: SAFE, OverallTime: 20.7s, OverallIterations: 9, TraceHistogramMax: 27, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 80 SDtfs, 1567 SDslu, 481 SDs, 0 SdLazy, 1706 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1557 GetRequests, 914 SyntacticMatches, 53 SemanticMatches, 590 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52507 ImplicationChecksByTransitivity, 16.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=328occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 9 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 110 PreInvPairs, 110 NumberOfFragments, 52 HoareAnnotationTreeSize, 110 FomulaSimplifications, 2716 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 2883 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 1274 NumberOfCodeBlocks, 1274 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1871 ConstructedInterpolants, 0 QuantifiedInterpolants, 2060805 SizeOfPredicates, 106 NumberOfNonLiveVariables, 1045 ConjunctsInSsa, 265 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 3952/15609 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 correct! Received shutdown request...