./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_907efe71-8c38-41e0-be7a-98af972e6b2d/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_907efe71-8c38-41e0-be7a-98af972e6b2d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_907efe71-8c38-41e0-be7a-98af972e6b2d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_907efe71-8c38-41e0-be7a-98af972e6b2d/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label04.c -s /tmp/vcloud-vcloud-master/worker/run_dir_907efe71-8c38-41e0-be7a-98af972e6b2d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_907efe71-8c38-41e0-be7a-98af972e6b2d/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fbfe8dec550fadf4da01fadd46005a09263b3b04 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:57:29,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:57:29,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:57:29,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:57:29,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:57:29,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:57:29,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:57:29,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:57:29,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:57:29,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:57:29,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:57:29,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:57:29,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:57:29,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:57:29,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:57:29,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:57:29,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:57:29,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:57:29,696 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:57:29,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:57:29,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:57:29,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:57:29,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:57:29,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:57:29,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:57:29,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:57:29,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:57:29,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:57:29,714 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:57:29,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:57:29,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:57:29,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:57:29,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:57:29,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:57:29,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:57:29,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:57:29,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:57:29,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:57:29,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:57:29,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:57:29,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:57:29,723 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_907efe71-8c38-41e0-be7a-98af972e6b2d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:57:29,747 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:57:29,757 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:57:29,758 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:57:29,758 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:57:29,758 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:57:29,758 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:57:29,759 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:57:29,759 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:57:29,759 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:57:29,759 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:57:29,759 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:57:29,760 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:57:29,760 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:57:29,760 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:57:29,760 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:57:29,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:57:29,761 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:57:29,762 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:57:29,762 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:57:29,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:57:29,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:57:29,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:57:29,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:57:29,763 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:57:29,763 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:57:29,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:57:29,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:57:29,764 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:57:29,765 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:57:29,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:57:29,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:57:29,765 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:57:29,766 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:57:29,766 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:57:29,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:57:29,766 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:57:29,767 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:57:29,767 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_907efe71-8c38-41e0-be7a-98af972e6b2d/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 ! call(__VERIFIER_error())) ) 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 -> fbfe8dec550fadf4da01fadd46005a09263b3b04 [2019-11-26 02:57:29,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:57:29,961 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:57:29,963 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:57:29,965 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:57:29,965 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:57:29,966 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_907efe71-8c38-41e0-be7a-98af972e6b2d/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label04.c [2019-11-26 02:57:30,025 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_907efe71-8c38-41e0-be7a-98af972e6b2d/bin/utaipan/data/ab12c9984/ca8526d038834e448da1e4410ab2d73b/FLAGac8892527 [2019-11-26 02:57:30,506 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:57:30,507 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_907efe71-8c38-41e0-be7a-98af972e6b2d/sv-benchmarks/c/eca-rers2012/Problem02_label04.c [2019-11-26 02:57:30,518 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_907efe71-8c38-41e0-be7a-98af972e6b2d/bin/utaipan/data/ab12c9984/ca8526d038834e448da1e4410ab2d73b/FLAGac8892527 [2019-11-26 02:57:30,807 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_907efe71-8c38-41e0-be7a-98af972e6b2d/bin/utaipan/data/ab12c9984/ca8526d038834e448da1e4410ab2d73b [2019-11-26 02:57:30,809 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:57:30,810 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:57:30,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:57:30,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:57:30,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:57:30,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:57:30" (1/1) ... [2019-11-26 02:57:30,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19035831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:30, skipping insertion in model container [2019-11-26 02:57:30,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:57:30" (1/1) ... [2019-11-26 02:57:30,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:57:30,895 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:57:31,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:57:31,369 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:57:31,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:57:31,479 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:57:31,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31 WrapperNode [2019-11-26 02:57:31,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:57:31,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:57:31,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:57:31,480 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:57:31,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (1/1) ... [2019-11-26 02:57:31,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (1/1) ... [2019-11-26 02:57:31,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:57:31,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:57:31,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:57:31,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:57:31,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (1/1) ... [2019-11-26 02:57:31,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (1/1) ... [2019-11-26 02:57:31,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (1/1) ... [2019-11-26 02:57:31,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (1/1) ... [2019-11-26 02:57:31,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (1/1) ... [2019-11-26 02:57:31,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (1/1) ... [2019-11-26 02:57:31,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (1/1) ... [2019-11-26 02:57:31,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:57:31,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:57:31,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:57:31,653 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:57:31,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_907efe71-8c38-41e0-be7a-98af972e6b2d/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-11-26 02:57:31,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:57:31,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:57:33,715 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:57:33,715 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:57:33,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:57:33 BoogieIcfgContainer [2019-11-26 02:57:33,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:57:33,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:57:33,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:57:33,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:57:33,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:57:30" (1/3) ... [2019-11-26 02:57:33,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac12d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:57:33, skipping insertion in model container [2019-11-26 02:57:33,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:31" (2/3) ... [2019-11-26 02:57:33,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac12d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:57:33, skipping insertion in model container [2019-11-26 02:57:33,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:57:33" (3/3) ... [2019-11-26 02:57:33,726 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label04.c [2019-11-26 02:57:33,735 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:57:33,742 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:57:33,752 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:57:33,785 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:57:33,785 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:57:33,785 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:57:33,786 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:57:33,786 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:57:33,786 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:57:33,786 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:57:33,786 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:57:33,805 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-26 02:57:33,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-26 02:57:33,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:33,817 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:33,818 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:33,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:33,824 INFO L82 PathProgramCache]: Analyzing trace with hash 925949065, now seen corresponding path program 1 times [2019-11-26 02:57:33,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:33,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322099092] [2019-11-26 02:57:33,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:34,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322099092] [2019-11-26 02:57:34,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:34,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:34,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807275409] [2019-11-26 02:57:34,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:34,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:34,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:34,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:34,201 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-26 02:57:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:35,004 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-26 02:57:35,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:35,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-26 02:57:35,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:35,019 INFO L225 Difference]: With dead ends: 333 [2019-11-26 02:57:35,019 INFO L226 Difference]: Without dead ends: 243 [2019-11-26 02:57:35,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:35,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-26 02:57:35,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-26 02:57:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-26 02:57:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 453 transitions. [2019-11-26 02:57:35,079 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 453 transitions. Word has length 80 [2019-11-26 02:57:35,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:35,082 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 453 transitions. [2019-11-26 02:57:35,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:35,082 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 453 transitions. [2019-11-26 02:57:35,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-26 02:57:35,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:35,090 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:35,090 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:35,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:35,091 INFO L82 PathProgramCache]: Analyzing trace with hash 221749544, now seen corresponding path program 1 times [2019-11-26 02:57:35,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:35,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131700356] [2019-11-26 02:57:35,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:35,172 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:35,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131700356] [2019-11-26 02:57:35,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:35,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:35,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888011259] [2019-11-26 02:57:35,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:35,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:35,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:35,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:35,176 INFO L87 Difference]: Start difference. First operand 243 states and 453 transitions. Second operand 4 states. [2019-11-26 02:57:35,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:35,784 INFO L93 Difference]: Finished difference Result 807 states and 1498 transitions. [2019-11-26 02:57:35,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:35,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-26 02:57:35,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:35,790 INFO L225 Difference]: With dead ends: 807 [2019-11-26 02:57:35,790 INFO L226 Difference]: Without dead ends: 565 [2019-11-26 02:57:35,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:35,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-11-26 02:57:35,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 403. [2019-11-26 02:57:35,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-11-26 02:57:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 719 transitions. [2019-11-26 02:57:35,841 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 719 transitions. Word has length 98 [2019-11-26 02:57:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:35,842 INFO L462 AbstractCegarLoop]: Abstraction has 403 states and 719 transitions. [2019-11-26 02:57:35,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 719 transitions. [2019-11-26 02:57:35,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-26 02:57:35,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:35,848 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:35,848 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:35,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:35,849 INFO L82 PathProgramCache]: Analyzing trace with hash -875195683, now seen corresponding path program 1 times [2019-11-26 02:57:35,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:35,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214497435] [2019-11-26 02:57:35,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:35,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214497435] [2019-11-26 02:57:35,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:35,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:35,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958660831] [2019-11-26 02:57:35,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:35,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:35,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:35,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:35,992 INFO L87 Difference]: Start difference. First operand 403 states and 719 transitions. Second operand 4 states. [2019-11-26 02:57:36,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:36,707 INFO L93 Difference]: Finished difference Result 1445 states and 2561 transitions. [2019-11-26 02:57:36,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:36,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-26 02:57:36,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:36,714 INFO L225 Difference]: With dead ends: 1445 [2019-11-26 02:57:36,714 INFO L226 Difference]: Without dead ends: 1043 [2019-11-26 02:57:36,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:36,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-26 02:57:36,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 883. [2019-11-26 02:57:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-26 02:57:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1447 transitions. [2019-11-26 02:57:36,754 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1447 transitions. Word has length 102 [2019-11-26 02:57:36,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:36,754 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1447 transitions. [2019-11-26 02:57:36,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:36,754 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1447 transitions. [2019-11-26 02:57:36,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-26 02:57:36,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:36,761 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:36,761 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:36,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:36,762 INFO L82 PathProgramCache]: Analyzing trace with hash 11614770, now seen corresponding path program 1 times [2019-11-26 02:57:36,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:36,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786777551] [2019-11-26 02:57:36,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:36,841 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:36,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786777551] [2019-11-26 02:57:36,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:36,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:57:36,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554726150] [2019-11-26 02:57:36,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:57:36,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:36,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:57:36,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:57:36,843 INFO L87 Difference]: Start difference. First operand 883 states and 1447 transitions. Second operand 3 states. [2019-11-26 02:57:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:37,266 INFO L93 Difference]: Finished difference Result 2165 states and 3504 transitions. [2019-11-26 02:57:37,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:57:37,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-26 02:57:37,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:37,274 INFO L225 Difference]: With dead ends: 2165 [2019-11-26 02:57:37,274 INFO L226 Difference]: Without dead ends: 1283 [2019-11-26 02:57:37,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:57:37,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-11-26 02:57:37,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-11-26 02:57:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-26 02:57:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1843 transitions. [2019-11-26 02:57:37,323 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1843 transitions. Word has length 102 [2019-11-26 02:57:37,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:37,323 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1843 transitions. [2019-11-26 02:57:37,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:57:37,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1843 transitions. [2019-11-26 02:57:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-26 02:57:37,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:37,330 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:37,330 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:37,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:37,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2118176117, now seen corresponding path program 1 times [2019-11-26 02:57:37,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:37,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627014026] [2019-11-26 02:57:37,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-26 02:57:37,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627014026] [2019-11-26 02:57:37,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:37,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:37,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774515240] [2019-11-26 02:57:37,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:37,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:37,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:37,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:37,481 INFO L87 Difference]: Start difference. First operand 1283 states and 1843 transitions. Second operand 4 states. [2019-11-26 02:57:38,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:38,134 INFO L93 Difference]: Finished difference Result 2965 states and 4271 transitions. [2019-11-26 02:57:38,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:38,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-26 02:57:38,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:38,146 INFO L225 Difference]: With dead ends: 2965 [2019-11-26 02:57:38,146 INFO L226 Difference]: Without dead ends: 1683 [2019-11-26 02:57:38,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:38,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2019-11-26 02:57:38,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1123. [2019-11-26 02:57:38,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-11-26 02:57:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1551 transitions. [2019-11-26 02:57:38,183 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1551 transitions. Word has length 107 [2019-11-26 02:57:38,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:38,184 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1551 transitions. [2019-11-26 02:57:38,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:38,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1551 transitions. [2019-11-26 02:57:38,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-26 02:57:38,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:38,188 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:38,188 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:38,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:38,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1177511591, now seen corresponding path program 1 times [2019-11-26 02:57:38,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:38,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225477993] [2019-11-26 02:57:38,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:38,273 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:38,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225477993] [2019-11-26 02:57:38,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:38,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:38,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538197923] [2019-11-26 02:57:38,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:57:38,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:38,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:57:38,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:57:38,277 INFO L87 Difference]: Start difference. First operand 1123 states and 1551 transitions. Second operand 3 states. [2019-11-26 02:57:38,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:38,630 INFO L93 Difference]: Finished difference Result 2405 states and 3281 transitions. [2019-11-26 02:57:38,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:57:38,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-26 02:57:38,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:38,638 INFO L225 Difference]: With dead ends: 2405 [2019-11-26 02:57:38,638 INFO L226 Difference]: Without dead ends: 1283 [2019-11-26 02:57:38,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:57:38,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-11-26 02:57:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1203. [2019-11-26 02:57:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-11-26 02:57:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1519 transitions. [2019-11-26 02:57:38,668 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1519 transitions. Word has length 120 [2019-11-26 02:57:38,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:38,668 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1519 transitions. [2019-11-26 02:57:38,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:57:38,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1519 transitions. [2019-11-26 02:57:38,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-26 02:57:38,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:38,672 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:38,673 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:38,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:38,673 INFO L82 PathProgramCache]: Analyzing trace with hash 97823886, now seen corresponding path program 1 times [2019-11-26 02:57:38,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:38,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985044340] [2019-11-26 02:57:38,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-26 02:57:38,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985044340] [2019-11-26 02:57:38,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:38,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:38,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69244786] [2019-11-26 02:57:38,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:57:38,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:38,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:57:38,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:57:38,753 INFO L87 Difference]: Start difference. First operand 1203 states and 1519 transitions. Second operand 3 states. [2019-11-26 02:57:39,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:39,087 INFO L93 Difference]: Finished difference Result 2725 states and 3418 transitions. [2019-11-26 02:57:39,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:57:39,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-11-26 02:57:39,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:39,094 INFO L225 Difference]: With dead ends: 2725 [2019-11-26 02:57:39,094 INFO L226 Difference]: Without dead ends: 1123 [2019-11-26 02:57:39,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:57:39,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-11-26 02:57:39,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1043. [2019-11-26 02:57:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-26 02:57:39,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1237 transitions. [2019-11-26 02:57:39,123 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1237 transitions. Word has length 171 [2019-11-26 02:57:39,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:39,123 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1237 transitions. [2019-11-26 02:57:39,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:57:39,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1237 transitions. [2019-11-26 02:57:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-26 02:57:39,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:39,127 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:39,128 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:39,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:39,128 INFO L82 PathProgramCache]: Analyzing trace with hash -257183503, now seen corresponding path program 1 times [2019-11-26 02:57:39,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:39,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706748925] [2019-11-26 02:57:39,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-26 02:57:39,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706748925] [2019-11-26 02:57:39,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092635417] [2019-11-26 02:57:39,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_907efe71-8c38-41e0-be7a-98af972e6b2d/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-11-26 02:57:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:39,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-26 02:57:39,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:57:39,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:57:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-26 02:57:39,502 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:57:39,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-26 02:57:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-26 02:57:39,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:57:39,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 6 [2019-11-26 02:57:39,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697180670] [2019-11-26 02:57:39,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:57:39,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:39,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:57:39,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:57:39,562 INFO L87 Difference]: Start difference. First operand 1043 states and 1237 transitions. Second operand 5 states. [2019-11-26 02:57:40,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:40,172 INFO L93 Difference]: Finished difference Result 2121 states and 2509 transitions. [2019-11-26 02:57:40,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:57:40,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2019-11-26 02:57:40,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:40,178 INFO L225 Difference]: With dead ends: 2121 [2019-11-26 02:57:40,178 INFO L226 Difference]: Without dead ends: 1079 [2019-11-26 02:57:40,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 367 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:57:40,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-26 02:57:40,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1043. [2019-11-26 02:57:40,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-26 02:57:40,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1224 transitions. [2019-11-26 02:57:40,209 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1224 transitions. Word has length 185 [2019-11-26 02:57:40,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:40,210 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1224 transitions. [2019-11-26 02:57:40,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:57:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1224 transitions. [2019-11-26 02:57:40,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-26 02:57:40,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:40,214 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:40,418 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:57:40,418 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:40,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:40,418 INFO L82 PathProgramCache]: Analyzing trace with hash -391008802, now seen corresponding path program 1 times [2019-11-26 02:57:40,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:40,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994232609] [2019-11-26 02:57:40,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-26 02:57:40,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994232609] [2019-11-26 02:57:40,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:40,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:57:40,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859880563] [2019-11-26 02:57:40,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:57:40,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:40,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:57:40,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:57:40,523 INFO L87 Difference]: Start difference. First operand 1043 states and 1224 transitions. Second operand 3 states. [2019-11-26 02:57:40,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:40,859 INFO L93 Difference]: Finished difference Result 2485 states and 2937 transitions. [2019-11-26 02:57:40,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:57:40,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-11-26 02:57:40,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:40,866 INFO L225 Difference]: With dead ends: 2485 [2019-11-26 02:57:40,866 INFO L226 Difference]: Without dead ends: 1363 [2019-11-26 02:57:40,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:57:40,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-11-26 02:57:40,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1203. [2019-11-26 02:57:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-11-26 02:57:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1382 transitions. [2019-11-26 02:57:40,897 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1382 transitions. Word has length 213 [2019-11-26 02:57:40,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:40,898 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1382 transitions. [2019-11-26 02:57:40,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:57:40,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1382 transitions. [2019-11-26 02:57:40,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-26 02:57:40,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:40,903 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:40,903 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:40,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:40,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1460296101, now seen corresponding path program 1 times [2019-11-26 02:57:40,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:40,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298350610] [2019-11-26 02:57:40,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:41,192 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 177 proven. 9 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-26 02:57:41,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298350610] [2019-11-26 02:57:41,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980066187] [2019-11-26 02:57:41,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_907efe71-8c38-41e0-be7a-98af972e6b2d/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-11-26 02:57:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:41,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:57:41,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:57:41,386 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-26 02:57:41,386 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:57:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-26 02:57:41,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:57:41,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 10 [2019-11-26 02:57:41,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452711385] [2019-11-26 02:57:41,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:41,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:41,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:41,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:57:41,442 INFO L87 Difference]: Start difference. First operand 1203 states and 1382 transitions. Second operand 4 states. [2019-11-26 02:57:41,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:41,943 INFO L93 Difference]: Finished difference Result 2483 states and 2837 transitions. [2019-11-26 02:57:41,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:41,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-11-26 02:57:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:41,943 INFO L225 Difference]: With dead ends: 2483 [2019-11-26 02:57:41,944 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:57:41,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:57:41,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:57:41,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:57:41,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:57:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:57:41,947 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 218 [2019-11-26 02:57:41,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:41,947 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:57:41,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:41,947 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:57:41,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:57:42,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:57:42,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:57:42,665 WARN L192 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 41 [2019-11-26 02:57:43,072 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 41 [2019-11-26 02:57:43,075 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-26 02:57:43,075 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-26 02:57:43,075 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-26 02:57:43,076 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-26 02:57:43,076 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-26 02:57:43,076 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-26 02:57:43,076 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-26 02:57:43,076 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-26 02:57:43,076 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-26 02:57:43,076 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-26 02:57:43,076 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-26 02:57:43,076 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-26 02:57:43,076 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-26 02:57:43,077 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-26 02:57:43,077 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-26 02:57:43,077 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-26 02:57:43,077 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-26 02:57:43,077 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-26 02:57:43,077 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-26 02:57:43,077 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-26 02:57:43,077 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-26 02:57:43,077 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-26 02:57:43,077 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-26 02:57:43,077 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-26 02:57:43,078 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-26 02:57:43,078 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:57:43,078 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-26 02:57:43,078 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-26 02:57:43,078 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-26 02:57:43,078 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-26 02:57:43,078 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-26 02:57:43,078 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-26 02:57:43,078 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-26 02:57:43,079 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-26 02:57:43,079 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-26 02:57:43,079 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-26 02:57:43,079 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 490) no Hoare annotation was computed. [2019-11-26 02:57:43,079 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-26 02:57:43,079 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-26 02:57:43,079 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-26 02:57:43,079 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-26 02:57:43,080 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse8 (= ~a25~0 1)) (.cse6 (= ~a19~0 1))) (let ((.cse7 (= ~a28~0 7)) (.cse1 (not .cse6)) (.cse2 (<= 10 ~a28~0)) (.cse9 (= ~a11~0 1)) (.cse10 (<= ~a19~0 0)) (.cse11 (not .cse8)) (.cse5 (not (= ~a28~0 11))) (.cse0 (= ~a28~0 9)) (.cse3 (= ~a17~0 8)) (.cse4 (= ~a21~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9) (and .cse2 .cse6 .cse8) (and .cse10 .cse11 .cse3) (and .cse3 .cse7 .cse4) (and .cse3 .cse8 .cse5) (and .cse1 .cse11 .cse3 .cse5) (and .cse0 .cse3 .cse9) (and .cse2 .cse6 .cse9) (and .cse10 .cse11 .cse5) (and .cse0 .cse3 .cse4)))) [2019-11-26 02:57:43,080 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-26 02:57:43,080 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-26 02:57:43,080 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-26 02:57:43,080 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-26 02:57:43,080 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-26 02:57:43,080 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-26 02:57:43,080 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-26 02:57:43,080 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-26 02:57:43,081 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-26 02:57:43,081 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-26 02:57:43,081 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse8 (= ~a25~0 1)) (.cse6 (= ~a19~0 1))) (let ((.cse7 (= ~a28~0 7)) (.cse1 (not .cse6)) (.cse2 (<= 10 ~a28~0)) (.cse9 (= ~a11~0 1)) (.cse10 (<= ~a19~0 0)) (.cse11 (not .cse8)) (.cse5 (not (= ~a28~0 11))) (.cse0 (= ~a28~0 9)) (.cse3 (= ~a17~0 8)) (.cse4 (= ~a21~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9) (and .cse2 .cse6 .cse8) (and .cse10 .cse11 .cse3) (and .cse3 .cse7 .cse4) (and .cse3 .cse8 .cse5) (and .cse1 .cse11 .cse3 .cse5) (and .cse0 .cse3 .cse9) (and .cse2 .cse6 .cse9) (and .cse10 .cse11 .cse5) (and .cse0 .cse3 .cse4)))) [2019-11-26 02:57:43,081 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-26 02:57:43,081 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-26 02:57:43,081 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-26 02:57:43,081 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-26 02:57:43,081 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-26 02:57:43,081 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-26 02:57:43,082 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-26 02:57:43,082 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-26 02:57:43,082 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-26 02:57:43,082 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-26 02:57:43,082 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:57:43,082 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-26 02:57:43,082 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-26 02:57:43,082 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-26 02:57:43,082 INFO L444 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-26 02:57:43,082 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-26 02:57:43,083 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-26 02:57:43,083 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-26 02:57:43,083 INFO L444 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-26 02:57:43,083 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-26 02:57:43,083 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-26 02:57:43,083 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-26 02:57:43,083 INFO L444 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-26 02:57:43,083 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-26 02:57:43,083 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-26 02:57:43,083 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-26 02:57:43,083 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-26 02:57:43,084 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-26 02:57:43,084 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-26 02:57:43,084 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-26 02:57:43,084 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-26 02:57:43,084 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-26 02:57:43,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:57:43 BoogieIcfgContainer [2019-11-26 02:57:43,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:57:43,125 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:57:43,125 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:57:43,125 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:57:43,126 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:57:33" (3/4) ... [2019-11-26 02:57:43,128 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:57:43,152 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 110 nodes and edges [2019-11-26 02:57:43,153 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-11-26 02:57:43,155 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-11-26 02:57:43,156 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 02:57:43,348 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_907efe71-8c38-41e0-be7a-98af972e6b2d/bin/utaipan/witness.graphml [2019-11-26 02:57:43,349 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:57:43,350 INFO L168 Benchmark]: Toolchain (without parser) took 12539.66 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 423.6 MB). Free memory was 939.3 MB in the beginning and 1.3 GB in the end (delta: -358.8 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:43,350 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:57:43,351 INFO L168 Benchmark]: CACSL2BoogieTranslator took 668.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:43,351 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:43,352 INFO L168 Benchmark]: Boogie Preprocessor took 70.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:43,353 INFO L168 Benchmark]: RCFGBuilder took 2064.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 884.4 MB in the end (delta: 217.7 MB). Peak memory consumption was 217.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:43,353 INFO L168 Benchmark]: TraceAbstraction took 9406.71 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 287.8 MB). Free memory was 884.4 MB in the beginning and 1.3 GB in the end (delta: -440.2 MB). Peak memory consumption was 178.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:43,354 INFO L168 Benchmark]: Witness Printer took 223.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:43,356 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 668.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2064.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 884.4 MB in the end (delta: 217.7 MB). Peak memory consumption was 217.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9406.71 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 287.8 MB). Free memory was 884.4 MB in the beginning and 1.3 GB in the end (delta: -440.2 MB). Peak memory consumption was 178.4 MB. Max. memory is 11.5 GB. * Witness Printer took 223.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 490]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((a28 == 9 && !(a19 == 1)) || (((10 <= a28 && a17 == 8) && a21 == 1) && !(a28 == 11))) || (((a19 == 1 && a28 == 7) && a25 == 1) && a11 == 1)) || ((10 <= a28 && a19 == 1) && a25 == 1)) || ((a19 <= 0 && !(a25 == 1)) && a17 == 8)) || ((a17 == 8 && a28 == 7) && a21 == 1)) || ((a17 == 8 && a25 == 1) && !(a28 == 11))) || (((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && !(a28 == 11))) || ((a28 == 9 && a17 == 8) && a11 == 1)) || ((10 <= a28 && a19 == 1) && a11 == 1)) || ((a19 <= 0 && !(a25 == 1)) && !(a28 == 11))) || ((a28 == 9 && a17 == 8) && a21 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((a28 == 9 && !(a19 == 1)) || (((10 <= a28 && a17 == 8) && a21 == 1) && !(a28 == 11))) || (((a19 == 1 && a28 == 7) && a25 == 1) && a11 == 1)) || ((10 <= a28 && a19 == 1) && a25 == 1)) || ((a19 <= 0 && !(a25 == 1)) && a17 == 8)) || ((a17 == 8 && a28 == 7) && a21 == 1)) || ((a17 == 8 && a25 == 1) && !(a28 == 11))) || (((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && !(a28 == 11))) || ((a28 == 9 && a17 == 8) && a11 == 1)) || ((10 <= a28 && a19 == 1) && a11 == 1)) || ((a19 <= 0 && !(a25 == 1)) && !(a28 == 11))) || ((a28 == 9 && a17 == 8) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 9.3s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, HoareTripleCheckerStatistics: 766 SDtfs, 1162 SDslu, 123 SDs, 0 SdLazy, 3574 SolverSat, 861 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 844 GetRequests, 812 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1283occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1238 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 50 NumberOfFragments, 273 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2140 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1350 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1799 NumberOfCodeBlocks, 1799 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2188 ConstructedInterpolants, 0 QuantifiedInterpolants, 1009693 SizeOfPredicates, 8 NumberOfNonLiveVariables, 735 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 1692/1704 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...