./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label32.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_fd1c3ce9-5e67-43a3-a25d-8a1bdeb2d808/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fd1c3ce9-5e67-43a3-a25d-8a1bdeb2d808/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fd1c3ce9-5e67-43a3-a25d-8a1bdeb2d808/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fd1c3ce9-5e67-43a3-a25d-8a1bdeb2d808/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label32.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fd1c3ce9-5e67-43a3-a25d-8a1bdeb2d808/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fd1c3ce9-5e67-43a3-a25d-8a1bdeb2d808/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 28b1d24b851fc193321d917a51d82cffe4d9ea6e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:52:58,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:52:58,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:52:58,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:52:58,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:52:58,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:52:58,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:52:59,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:52:59,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:52:59,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:52:59,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:52:59,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:52:59,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:52:59,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:52:59,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:52:59,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:52:59,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:52:59,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:52:59,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:52:59,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:52:59,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:52:59,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:52:59,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:52:59,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:52:59,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:52:59,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:52:59,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:52:59,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:52:59,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:52:59,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:52:59,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:52:59,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:52:59,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:52:59,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:52:59,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:52:59,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:52:59,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:52:59,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:52:59,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:52:59,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:52:59,032 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:52:59,032 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fd1c3ce9-5e67-43a3-a25d-8a1bdeb2d808/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:52:59,045 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:52:59,048 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:52:59,049 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:52:59,049 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:52:59,050 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:52:59,050 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:52:59,050 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:52:59,050 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:52:59,050 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:52:59,051 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:52:59,052 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:52:59,052 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:52:59,052 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:52:59,052 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:52:59,053 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:52:59,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:52:59,054 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:52:59,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:52:59,054 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:52:59,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:52:59,054 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:52:59,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:52:59,055 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:52:59,055 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:52:59,055 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:52:59,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:52:59,056 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:52:59,056 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:52:59,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:52:59,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:52:59,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:52:59,057 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:52:59,057 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:52:59,057 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:52:59,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:52:59,058 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:52:59,058 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:52:59,058 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_fd1c3ce9-5e67-43a3-a25d-8a1bdeb2d808/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 -> 28b1d24b851fc193321d917a51d82cffe4d9ea6e [2019-11-26 02:52:59,240 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:52:59,250 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:52:59,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:52:59,260 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:52:59,260 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:52:59,261 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fd1c3ce9-5e67-43a3-a25d-8a1bdeb2d808/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem03_label32.c [2019-11-26 02:52:59,306 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd1c3ce9-5e67-43a3-a25d-8a1bdeb2d808/bin/utaipan/data/6b4a1f8f5/25fd9b76f55f448b913a463bcbce6787/FLAG716ad15a1 [2019-11-26 02:52:59,836 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:52:59,837 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fd1c3ce9-5e67-43a3-a25d-8a1bdeb2d808/sv-benchmarks/c/eca-rers2012/Problem03_label32.c [2019-11-26 02:52:59,853 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd1c3ce9-5e67-43a3-a25d-8a1bdeb2d808/bin/utaipan/data/6b4a1f8f5/25fd9b76f55f448b913a463bcbce6787/FLAG716ad15a1 [2019-11-26 02:53:00,114 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fd1c3ce9-5e67-43a3-a25d-8a1bdeb2d808/bin/utaipan/data/6b4a1f8f5/25fd9b76f55f448b913a463bcbce6787 [2019-11-26 02:53:00,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:53:00,118 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:53:00,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:53:00,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:53:00,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:53:00,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:53:00" (1/1) ... [2019-11-26 02:53:00,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@369cbf4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:53:00, skipping insertion in model container [2019-11-26 02:53:00,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:53:00" (1/1) ... [2019-11-26 02:53:00,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:53:00,210 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:53:00,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:53:00,913 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:53:01,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:53:01,171 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:53:01,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:53:01 WrapperNode [2019-11-26 02:53:01,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:53:01,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:53:01,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:53:01,173 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:53:01,181 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:53:01" (1/1) ... [2019-11-26 02:53:01,221 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:53:01" (1/1) ... [2019-11-26 02:53:01,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:53:01,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:53:01,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:53:01,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:53:01,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:53:01" (1/1) ... [2019-11-26 02:53:01,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:53:01" (1/1) ... [2019-11-26 02:53:01,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:53:01" (1/1) ... [2019-11-26 02:53:01,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:53:01" (1/1) ... [2019-11-26 02:53:01,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:53:01" (1/1) ... [2019-11-26 02:53:01,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:53:01" (1/1) ... [2019-11-26 02:53:01,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:53:01" (1/1) ... [2019-11-26 02:53:01,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:53:01,395 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:53:01,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:53:01,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:53:01,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:53:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd1c3ce9-5e67-43a3-a25d-8a1bdeb2d808/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:53:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:53:01,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:53:04,518 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:53:04,519 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:53:04,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:53:04 BoogieIcfgContainer [2019-11-26 02:53:04,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:53:04,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:53:04,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:53:04,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:53:04,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:53:00" (1/3) ... [2019-11-26 02:53:04,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2b27d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:53:04, skipping insertion in model container [2019-11-26 02:53:04,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:53:01" (2/3) ... [2019-11-26 02:53:04,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2b27d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:53:04, skipping insertion in model container [2019-11-26 02:53:04,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:53:04" (3/3) ... [2019-11-26 02:53:04,530 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label32.c [2019-11-26 02:53:04,539 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:53:04,547 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:53:04,556 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:53:04,590 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:53:04,591 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:53:04,591 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:53:04,591 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:53:04,591 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:53:04,591 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:53:04,592 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:53:04,592 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:53:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-26 02:53:04,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-26 02:53:04,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:53:04,631 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, 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:53:04,632 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:53:04,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:53:04,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1467441375, now seen corresponding path program 1 times [2019-11-26 02:53:04,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:53:04,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243090940] [2019-11-26 02:53:04,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:53:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:53:05,246 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:53:05,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243090940] [2019-11-26 02:53:05,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:53:05,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:53:05,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280083862] [2019-11-26 02:53:05,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:53:05,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:53:05,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:53:05,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:53:05,276 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-26 02:53:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:53:06,859 INFO L93 Difference]: Finished difference Result 585 states and 1145 transitions. [2019-11-26 02:53:06,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:53:06,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-26 02:53:06,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:53:06,876 INFO L225 Difference]: With dead ends: 585 [2019-11-26 02:53:06,876 INFO L226 Difference]: Without dead ends: 432 [2019-11-26 02:53:06,880 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:53:06,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-26 02:53:06,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 289. [2019-11-26 02:53:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-26 02:53:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 521 transitions. [2019-11-26 02:53:07,002 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 521 transitions. Word has length 143 [2019-11-26 02:53:07,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:53:07,004 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 521 transitions. [2019-11-26 02:53:07,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:53:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 521 transitions. [2019-11-26 02:53:07,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-26 02:53:07,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:53:07,013 INFO L410 BasicCegarLoop]: trace histogram [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, 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:53:07,013 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:53:07,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:53:07,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1977868352, now seen corresponding path program 1 times [2019-11-26 02:53:07,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:53:07,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699711913] [2019-11-26 02:53:07,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:53:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:53:07,098 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:53:07,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699711913] [2019-11-26 02:53:07,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:53:07,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:53:07,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875392500] [2019-11-26 02:53:07,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:53:07,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:53:07,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:53:07,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:53:07,104 INFO L87 Difference]: Start difference. First operand 289 states and 521 transitions. Second operand 3 states. [2019-11-26 02:53:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:53:07,830 INFO L93 Difference]: Finished difference Result 863 states and 1560 transitions. [2019-11-26 02:53:07,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:53:07,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-26 02:53:07,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:53:07,834 INFO L225 Difference]: With dead ends: 863 [2019-11-26 02:53:07,834 INFO L226 Difference]: Without dead ends: 575 [2019-11-26 02:53:07,836 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:53:07,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-11-26 02:53:07,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-11-26 02:53:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-11-26 02:53:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1015 transitions. [2019-11-26 02:53:07,875 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1015 transitions. Word has length 151 [2019-11-26 02:53:07,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:53:07,876 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1015 transitions. [2019-11-26 02:53:07,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:53:07,876 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1015 transitions. [2019-11-26 02:53:07,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-26 02:53:07,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:53:07,882 INFO L410 BasicCegarLoop]: trace histogram [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, 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:53:07,883 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:53:07,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:53:07,883 INFO L82 PathProgramCache]: Analyzing trace with hash -119303943, now seen corresponding path program 1 times [2019-11-26 02:53:07,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:53:07,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452671335] [2019-11-26 02:53:07,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:53:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:53:07,961 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:53:07,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452671335] [2019-11-26 02:53:07,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:53:07,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:53:07,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392755276] [2019-11-26 02:53:07,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:53:07,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:53:07,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:53:07,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:53:07,963 INFO L87 Difference]: Start difference. First operand 575 states and 1015 transitions. Second operand 4 states. [2019-11-26 02:53:09,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:53:09,272 INFO L93 Difference]: Finished difference Result 2293 states and 4055 transitions. [2019-11-26 02:53:09,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:53:09,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-26 02:53:09,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:53:09,283 INFO L225 Difference]: With dead ends: 2293 [2019-11-26 02:53:09,284 INFO L226 Difference]: Without dead ends: 1719 [2019-11-26 02:53:09,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:53:09,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-11-26 02:53:09,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1147. [2019-11-26 02:53:09,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2019-11-26 02:53:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1880 transitions. [2019-11-26 02:53:09,330 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1880 transitions. Word has length 152 [2019-11-26 02:53:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:53:09,330 INFO L462 AbstractCegarLoop]: Abstraction has 1147 states and 1880 transitions. [2019-11-26 02:53:09,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:53:09,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1880 transitions. [2019-11-26 02:53:09,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-26 02:53:09,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:53:09,337 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 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:53:09,337 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:53:09,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:53:09,338 INFO L82 PathProgramCache]: Analyzing trace with hash 351589117, now seen corresponding path program 1 times [2019-11-26 02:53:09,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:53:09,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132258986] [2019-11-26 02:53:09,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:53:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:53:09,617 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:53:09,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132258986] [2019-11-26 02:53:09,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:53:09,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:53:09,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432928656] [2019-11-26 02:53:09,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:53:09,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:53:09,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:53:09,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:53:09,621 INFO L87 Difference]: Start difference. First operand 1147 states and 1880 transitions. Second operand 4 states. [2019-11-26 02:53:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:53:11,050 INFO L93 Difference]: Finished difference Result 4581 states and 7515 transitions. [2019-11-26 02:53:11,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:53:11,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-26 02:53:11,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:53:11,072 INFO L225 Difference]: With dead ends: 4581 [2019-11-26 02:53:11,073 INFO L226 Difference]: Without dead ends: 3435 [2019-11-26 02:53:11,076 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:53:11,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2019-11-26 02:53:11,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3435. [2019-11-26 02:53:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3435 states. [2019-11-26 02:53:11,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 5021 transitions. [2019-11-26 02:53:11,179 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 5021 transitions. Word has length 158 [2019-11-26 02:53:11,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:53:11,181 INFO L462 AbstractCegarLoop]: Abstraction has 3435 states and 5021 transitions. [2019-11-26 02:53:11,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:53:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 5021 transitions. [2019-11-26 02:53:11,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-26 02:53:11,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:53:11,189 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, 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, 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:53:11,190 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:53:11,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:53:11,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1925387518, now seen corresponding path program 1 times [2019-11-26 02:53:11,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:53:11,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665792173] [2019-11-26 02:53:11,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:53:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:53:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:53:11,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665792173] [2019-11-26 02:53:11,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:53:11,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:53:11,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764798741] [2019-11-26 02:53:11,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:53:11,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:53:11,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:53:11,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:53:11,329 INFO L87 Difference]: Start difference. First operand 3435 states and 5021 transitions. Second operand 3 states. [2019-11-26 02:53:12,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:53:12,080 INFO L93 Difference]: Finished difference Result 8013 states and 11565 transitions. [2019-11-26 02:53:12,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:53:12,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-26 02:53:12,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:53:12,106 INFO L225 Difference]: With dead ends: 8013 [2019-11-26 02:53:12,106 INFO L226 Difference]: Without dead ends: 4579 [2019-11-26 02:53:12,110 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:53:12,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4579 states. [2019-11-26 02:53:12,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4579 to 4579. [2019-11-26 02:53:12,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4579 states. [2019-11-26 02:53:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4579 states to 4579 states and 6383 transitions. [2019-11-26 02:53:12,272 INFO L78 Accepts]: Start accepts. Automaton has 4579 states and 6383 transitions. Word has length 184 [2019-11-26 02:53:12,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:53:12,272 INFO L462 AbstractCegarLoop]: Abstraction has 4579 states and 6383 transitions. [2019-11-26 02:53:12,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:53:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 4579 states and 6383 transitions. [2019-11-26 02:53:12,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-26 02:53:12,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:53:12,284 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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:53:12,284 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:53:12,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:53:12,285 INFO L82 PathProgramCache]: Analyzing trace with hash -2078780571, now seen corresponding path program 1 times [2019-11-26 02:53:12,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:53:12,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204187855] [2019-11-26 02:53:12,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:53:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:53:12,491 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:53:12,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204187855] [2019-11-26 02:53:12,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430458414] [2019-11-26 02:53:12,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd1c3ce9-5e67-43a3-a25d-8a1bdeb2d808/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:53:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:53:12,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:53:12,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:53:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:53:12,738 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:53:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:53:12,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:53:12,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-26 02:53:12,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022371140] [2019-11-26 02:53:12,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:53:12,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:53:12,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:53:12,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:53:12,810 INFO L87 Difference]: Start difference. First operand 4579 states and 6383 transitions. Second operand 3 states. [2019-11-26 02:53:13,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:53:13,782 INFO L93 Difference]: Finished difference Result 10301 states and 14436 transitions. [2019-11-26 02:53:13,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:53:13,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-11-26 02:53:13,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:53:13,811 INFO L225 Difference]: With dead ends: 10301 [2019-11-26 02:53:13,811 INFO L226 Difference]: Without dead ends: 5723 [2019-11-26 02:53:13,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 379 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:53:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5723 states. [2019-11-26 02:53:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5723 to 5723. [2019-11-26 02:53:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5723 states. [2019-11-26 02:53:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5723 states to 5723 states and 7919 transitions. [2019-11-26 02:53:13,933 INFO L78 Accepts]: Start accepts. Automaton has 5723 states and 7919 transitions. Word has length 191 [2019-11-26 02:53:13,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:53:13,933 INFO L462 AbstractCegarLoop]: Abstraction has 5723 states and 7919 transitions. [2019-11-26 02:53:13,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:53:13,934 INFO L276 IsEmpty]: Start isEmpty. Operand 5723 states and 7919 transitions. [2019-11-26 02:53:13,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-26 02:53:13,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:53:13,948 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, 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, 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:53:14,152 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:53:14,153 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:53:14,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:53:14,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2057972740, now seen corresponding path program 1 times [2019-11-26 02:53:14,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:53:14,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473447368] [2019-11-26 02:53:14,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:53:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:53:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:53:14,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473447368] [2019-11-26 02:53:14,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:53:14,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:53:14,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658640306] [2019-11-26 02:53:14,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:53:14,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:53:14,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:53:14,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:53:14,349 INFO L87 Difference]: Start difference. First operand 5723 states and 7919 transitions. Second operand 4 states. [2019-11-26 02:53:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:53:15,821 INFO L93 Difference]: Finished difference Result 13018 states and 17809 transitions. [2019-11-26 02:53:15,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:53:15,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2019-11-26 02:53:15,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:53:15,859 INFO L225 Difference]: With dead ends: 13018 [2019-11-26 02:53:15,859 INFO L226 Difference]: Without dead ends: 7296 [2019-11-26 02:53:15,866 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:53:15,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7296 states. [2019-11-26 02:53:15,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7296 to 6152. [2019-11-26 02:53:15,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6152 states. [2019-11-26 02:53:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6152 states to 6152 states and 8311 transitions. [2019-11-26 02:53:15,997 INFO L78 Accepts]: Start accepts. Automaton has 6152 states and 8311 transitions. Word has length 206 [2019-11-26 02:53:15,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:53:15,997 INFO L462 AbstractCegarLoop]: Abstraction has 6152 states and 8311 transitions. [2019-11-26 02:53:15,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:53:15,997 INFO L276 IsEmpty]: Start isEmpty. Operand 6152 states and 8311 transitions. [2019-11-26 02:53:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-26 02:53:16,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:53:16,011 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:53:16,011 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:53:16,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:53:16,012 INFO L82 PathProgramCache]: Analyzing trace with hash 139295340, now seen corresponding path program 1 times [2019-11-26 02:53:16,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:53:16,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010308975] [2019-11-26 02:53:16,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:53:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:53:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-26 02:53:16,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010308975] [2019-11-26 02:53:16,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:53:16,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:53:16,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606316457] [2019-11-26 02:53:16,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:53:16,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:53:16,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:53:16,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:53:16,121 INFO L87 Difference]: Start difference. First operand 6152 states and 8311 transitions. Second operand 4 states. [2019-11-26 02:53:17,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:53:17,513 INFO L93 Difference]: Finished difference Result 21598 states and 28996 transitions. [2019-11-26 02:53:17,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:53:17,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-11-26 02:53:17,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:53:17,561 INFO L225 Difference]: With dead ends: 21598 [2019-11-26 02:53:17,562 INFO L226 Difference]: Without dead ends: 15447 [2019-11-26 02:53:17,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:53:17,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15447 states. [2019-11-26 02:53:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15447 to 11014. [2019-11-26 02:53:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11014 states. [2019-11-26 02:53:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11014 states to 11014 states and 14192 transitions. [2019-11-26 02:53:17,762 INFO L78 Accepts]: Start accepts. Automaton has 11014 states and 14192 transitions. Word has length 208 [2019-11-26 02:53:17,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:53:17,762 INFO L462 AbstractCegarLoop]: Abstraction has 11014 states and 14192 transitions. [2019-11-26 02:53:17,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:53:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 11014 states and 14192 transitions. [2019-11-26 02:53:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-11-26 02:53:17,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:53:17,784 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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] [2019-11-26 02:53:17,785 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:53:17,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:53:17,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1482856025, now seen corresponding path program 1 times [2019-11-26 02:53:17,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:53:17,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889608504] [2019-11-26 02:53:17,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:53:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:53:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-26 02:53:18,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889608504] [2019-11-26 02:53:18,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3660454] [2019-11-26 02:53:18,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd1c3ce9-5e67-43a3-a25d-8a1bdeb2d808/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:53:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:53:18,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:53:18,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:53:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:53:18,378 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:53:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:53:18,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:53:18,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-26 02:53:18,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355697377] [2019-11-26 02:53:18,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:53:18,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:53:18,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:53:18,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:53:18,459 INFO L87 Difference]: Start difference. First operand 11014 states and 14192 transitions. Second operand 3 states. [2019-11-26 02:53:18,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:53:18,955 INFO L93 Difference]: Finished difference Result 21455 states and 27563 transitions. [2019-11-26 02:53:18,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:53:18,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2019-11-26 02:53:18,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:53:18,975 INFO L225 Difference]: With dead ends: 21455 [2019-11-26 02:53:18,975 INFO L226 Difference]: Without dead ends: 10442 [2019-11-26 02:53:18,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 566 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:53:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10442 states. [2019-11-26 02:53:19,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10442 to 9584. [2019-11-26 02:53:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9584 states. [2019-11-26 02:53:19,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9584 states to 9584 states and 12210 transitions. [2019-11-26 02:53:19,125 INFO L78 Accepts]: Start accepts. Automaton has 9584 states and 12210 transitions. Word has length 284 [2019-11-26 02:53:19,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:53:19,126 INFO L462 AbstractCegarLoop]: Abstraction has 9584 states and 12210 transitions. [2019-11-26 02:53:19,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:53:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 9584 states and 12210 transitions. [2019-11-26 02:53:19,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-11-26 02:53:19,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:53:19,152 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:53:19,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:53:19,365 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:53:19,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:53:19,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1973981930, now seen corresponding path program 1 times [2019-11-26 02:53:19,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:53:19,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522473178] [2019-11-26 02:53:19,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:53:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:53:19,607 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-26 02:53:19,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522473178] [2019-11-26 02:53:19,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312507946] [2019-11-26 02:53:19,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd1c3ce9-5e67-43a3-a25d-8a1bdeb2d808/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:53:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:53:19,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:53:19,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:53:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:53:19,937 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:53:20,172 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:53:20,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:53:20,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-26 02:53:20,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268226965] [2019-11-26 02:53:20,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:53:20,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:53:20,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:53:20,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:53:20,175 INFO L87 Difference]: Start difference. First operand 9584 states and 12210 transitions. Second operand 3 states. [2019-11-26 02:53:21,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:53:21,028 INFO L93 Difference]: Finished difference Result 21884 states and 28036 transitions. [2019-11-26 02:53:21,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:53:21,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-11-26 02:53:21,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:53:21,048 INFO L225 Difference]: With dead ends: 21884 [2019-11-26 02:53:21,048 INFO L226 Difference]: Without dead ends: 12301 [2019-11-26 02:53:21,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 597 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:53:21,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12301 states. [2019-11-26 02:53:21,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12301 to 11157. [2019-11-26 02:53:21,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11157 states. [2019-11-26 02:53:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11157 states to 11157 states and 13664 transitions. [2019-11-26 02:53:21,219 INFO L78 Accepts]: Start accepts. Automaton has 11157 states and 13664 transitions. Word has length 300 [2019-11-26 02:53:21,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:53:21,220 INFO L462 AbstractCegarLoop]: Abstraction has 11157 states and 13664 transitions. [2019-11-26 02:53:21,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:53:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand 11157 states and 13664 transitions. [2019-11-26 02:53:21,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-11-26 02:53:21,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:53:21,240 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:53:21,444 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:53:21,445 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:53:21,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:53:21,445 INFO L82 PathProgramCache]: Analyzing trace with hash 666489017, now seen corresponding path program 1 times [2019-11-26 02:53:21,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:53:21,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615249531] [2019-11-26 02:53:21,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:53:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:53:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:53:21,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615249531] [2019-11-26 02:53:21,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:53:21,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:53:21,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715894370] [2019-11-26 02:53:21,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:53:21,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:53:21,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:53:21,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:53:21,736 INFO L87 Difference]: Start difference. First operand 11157 states and 13664 transitions. Second operand 3 states. [2019-11-26 02:53:22,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:53:22,566 INFO L93 Difference]: Finished difference Result 24458 states and 29929 transitions. [2019-11-26 02:53:22,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:53:22,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2019-11-26 02:53:22,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:53:22,587 INFO L225 Difference]: With dead ends: 24458 [2019-11-26 02:53:22,588 INFO L226 Difference]: Without dead ends: 13302 [2019-11-26 02:53:22,600 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:53:22,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13302 states. [2019-11-26 02:53:22,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13302 to 13302. [2019-11-26 02:53:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13302 states. [2019-11-26 02:53:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13302 states to 13302 states and 15870 transitions. [2019-11-26 02:53:22,786 INFO L78 Accepts]: Start accepts. Automaton has 13302 states and 15870 transitions. Word has length 348 [2019-11-26 02:53:22,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:53:22,787 INFO L462 AbstractCegarLoop]: Abstraction has 13302 states and 15870 transitions. [2019-11-26 02:53:22,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:53:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 13302 states and 15870 transitions. [2019-11-26 02:53:22,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-11-26 02:53:22,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:53:22,816 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:53:22,816 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:53:22,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:53:22,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1746341816, now seen corresponding path program 1 times [2019-11-26 02:53:22,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:53:22,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481433036] [2019-11-26 02:53:22,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:53:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:53:23,162 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-26 02:53:23,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481433036] [2019-11-26 02:53:23,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:53:23,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:53:23,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282858631] [2019-11-26 02:53:23,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:53:23,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:53:23,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:53:23,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:53:23,167 INFO L87 Difference]: Start difference. First operand 13302 states and 15870 transitions. Second operand 3 states. [2019-11-26 02:53:24,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:53:24,017 INFO L93 Difference]: Finished difference Result 27318 states and 32552 transitions. [2019-11-26 02:53:24,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:53:24,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2019-11-26 02:53:24,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:53:24,040 INFO L225 Difference]: With dead ends: 27318 [2019-11-26 02:53:24,040 INFO L226 Difference]: Without dead ends: 14017 [2019-11-26 02:53:24,056 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:53:24,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14017 states. [2019-11-26 02:53:24,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14017 to 13588. [2019-11-26 02:53:24,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13588 states. [2019-11-26 02:53:24,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13588 states to 13588 states and 15719 transitions. [2019-11-26 02:53:24,233 INFO L78 Accepts]: Start accepts. Automaton has 13588 states and 15719 transitions. Word has length 375 [2019-11-26 02:53:24,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:53:24,234 INFO L462 AbstractCegarLoop]: Abstraction has 13588 states and 15719 transitions. [2019-11-26 02:53:24,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:53:24,234 INFO L276 IsEmpty]: Start isEmpty. Operand 13588 states and 15719 transitions. [2019-11-26 02:53:24,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-11-26 02:53:24,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:53:24,254 INFO L410 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:53:24,254 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:53:24,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:53:24,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2037116704, now seen corresponding path program 1 times [2019-11-26 02:53:24,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:53:24,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070731512] [2019-11-26 02:53:24,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:53:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:53:24,699 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 337 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:53:24,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070731512] [2019-11-26 02:53:24,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516504750] [2019-11-26 02:53:24,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd1c3ce9-5e67-43a3-a25d-8a1bdeb2d808/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:53:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:53:24,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:53:24,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:53:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-26 02:53:24,994 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:53:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-26 02:53:25,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:53:25,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-26 02:53:25,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891389945] [2019-11-26 02:53:25,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:53:25,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:53:25,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:53:25,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:53:25,137 INFO L87 Difference]: Start difference. First operand 13588 states and 15719 transitions. Second operand 3 states. [2019-11-26 02:53:25,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:53:25,997 INFO L93 Difference]: Finished difference Result 30033 states and 34677 transitions. [2019-11-26 02:53:25,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:53:25,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 380 [2019-11-26 02:53:25,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:53:25,998 INFO L225 Difference]: With dead ends: 30033 [2019-11-26 02:53:25,998 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:53:26,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 758 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:53:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:53:26,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:53:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:53:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:53:26,008 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 380 [2019-11-26 02:53:26,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:53:26,008 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:53:26,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:53:26,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:53:26,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:53:26,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:53:26,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:53:26,555 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 310 DAG size of output: 153 [2019-11-26 02:53:26,881 WARN L192 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 310 DAG size of output: 153 [2019-11-26 02:53:27,374 WARN L192 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 33 [2019-11-26 02:53:27,745 WARN L192 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 33 [2019-11-26 02:53:27,748 INFO L444 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,748 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,748 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,748 INFO L444 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,748 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,748 INFO L444 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,748 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,749 INFO L444 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,749 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,749 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,749 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,749 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,749 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,749 INFO L444 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,749 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,749 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,749 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,749 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,749 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,749 INFO L444 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,750 INFO L444 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,750 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,750 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,750 INFO L444 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,750 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,750 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,750 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,750 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,750 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,750 INFO L444 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,750 INFO L444 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,750 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,750 INFO L444 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,750 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,750 INFO L444 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,751 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,751 INFO L444 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,751 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,751 INFO L444 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,751 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,751 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,751 INFO L444 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,751 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,751 INFO L444 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,751 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,751 INFO L444 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,751 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,751 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:53:27,751 INFO L444 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,751 INFO L444 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,752 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,752 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,752 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,752 INFO L444 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,752 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,752 INFO L444 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,752 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,752 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,752 INFO L444 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,752 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,753 INFO L444 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,753 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,753 INFO L440 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse1 (= 1 ~a6~0))) (let ((.cse5 (= ~a11~0 1)) (.cse3 (= ~a26~0 1)) (.cse0 (= 1 ~a5~0)) (.cse4 (= ~a27~0 1)) (.cse2 (not (= ~a12~0 1))) (.cse6 (not .cse1))) (or (and .cse0 .cse1 .cse2 (<= ~a11~0 0) .cse3) (and .cse0 (not (= 1 ~a3~0))) (and .cse4 .cse0 .cse2 (not .cse5)) (and .cse0 .cse2 .cse5 .cse6 .cse3) (and .cse0 (<= ~a27~0 0)) (and .cse0 .cse4 .cse3) (and .cse0 .cse4 .cse2 .cse6)))) [2019-11-26 02:53:27,753 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,754 INFO L444 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,754 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,754 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1602) no Hoare annotation was computed. [2019-11-26 02:53:27,754 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,754 INFO L447 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-26 02:53:27,754 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,754 INFO L444 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,755 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,755 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,755 INFO L444 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,755 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,755 INFO L444 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,755 INFO L444 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,755 INFO L444 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,756 INFO L444 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,756 INFO L444 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,756 INFO L444 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,756 INFO L444 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,756 INFO L444 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,756 INFO L440 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse1 (= 1 ~a6~0))) (let ((.cse5 (= ~a11~0 1)) (.cse3 (= ~a26~0 1)) (.cse0 (= 1 ~a5~0)) (.cse4 (= ~a27~0 1)) (.cse2 (not (= ~a12~0 1))) (.cse6 (not .cse1))) (or (and .cse0 .cse1 .cse2 (<= ~a11~0 0) .cse3) (and .cse0 (not (= 1 ~a3~0))) (and .cse4 .cse0 .cse2 (not .cse5)) (and .cse0 .cse2 .cse5 .cse6 .cse3) (and .cse0 (<= ~a27~0 0)) (and .cse0 .cse4 .cse3) (and .cse0 .cse4 .cse2 .cse6)))) [2019-11-26 02:53:27,756 INFO L444 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,756 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,756 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,756 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,756 INFO L444 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,756 INFO L444 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,756 INFO L444 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,757 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,757 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,757 INFO L444 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,757 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,757 INFO L444 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-26 02:53:27,757 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,757 INFO L444 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,757 INFO L444 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,757 INFO L444 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-26 02:53:27,757 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,757 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,757 INFO L444 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,757 INFO L444 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,757 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,757 INFO L444 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-26 02:53:27,758 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,758 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,758 INFO L444 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-26 02:53:27,758 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,758 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,758 INFO L444 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,758 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,759 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,759 INFO L444 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,759 INFO L444 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,759 INFO L444 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,759 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:53:27,759 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,759 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,760 INFO L444 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,760 INFO L444 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,760 INFO L444 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,760 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,760 INFO L444 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,760 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,760 INFO L444 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,761 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,761 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,761 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,761 INFO L444 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,761 INFO L444 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,761 INFO L444 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,761 INFO L444 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,762 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,762 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,762 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,762 INFO L444 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,762 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,762 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,762 INFO L444 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,763 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,763 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,763 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,763 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,763 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,763 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,763 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-26 02:53:27,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:53:27 BoogieIcfgContainer [2019-11-26 02:53:27,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:53:27,790 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:53:27,790 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:53:27,790 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:53:27,790 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:53:04" (3/4) ... [2019-11-26 02:53:27,793 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:53:27,838 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 114 nodes and edges [2019-11-26 02:53:27,842 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-26 02:53:27,845 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-11-26 02:53:27,849 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 02:53:28,063 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fd1c3ce9-5e67-43a3-a25d-8a1bdeb2d808/bin/utaipan/witness.graphml [2019-11-26 02:53:28,063 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:53:28,064 INFO L168 Benchmark]: Toolchain (without parser) took 27946.36 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 999.3 MB). Free memory was 944.7 MB in the beginning and 1.3 GB in the end (delta: -306.0 MB). Peak memory consumption was 693.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:53:28,065 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:53:28,065 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1053.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -97.1 MB). Peak memory consumption was 35.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:53:28,065 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:53:28,066 INFO L168 Benchmark]: Boogie Preprocessor took 87.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:53:28,066 INFO L168 Benchmark]: RCFGBuilder took 3125.39 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 130.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -19.8 MB). Peak memory consumption was 280.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:53:28,066 INFO L168 Benchmark]: TraceAbstraction took 23268.49 ms. Allocated memory was 1.3 GB in the beginning and 2.0 GB in the end (delta: 750.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -263.4 MB). Peak memory consumption was 486.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:53:28,067 INFO L168 Benchmark]: Witness Printer took 273.55 ms. Allocated memory is still 2.0 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:53:28,069 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1053.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -97.1 MB). Peak memory consumption was 35.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 133.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3125.39 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 130.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -19.8 MB). Peak memory consumption was 280.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23268.49 ms. Allocated memory was 1.3 GB in the beginning and 2.0 GB in the end (delta: 750.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -263.4 MB). Peak memory consumption was 486.8 MB. Max. memory is 11.5 GB. * Witness Printer took 273.55 ms. Allocated memory is still 2.0 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1602]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: (((((((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && a26 == 1) || (1 == a5 && !(1 == a3))) || (((a27 == 1 && 1 == a5) && !(a12 == 1)) && !(a11 == 1))) || ((((1 == a5 && !(a12 == 1)) && a11 == 1) && !(1 == a6)) && a26 == 1)) || (1 == a5 && a27 <= 0)) || ((1 == a5 && a27 == 1) && a26 == 1)) || (((1 == a5 && a27 == 1) && !(a12 == 1)) && !(1 == a6)) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((1 == a5 && 1 == a6) && !(a12 == 1)) && a11 <= 0) && a26 == 1) || (1 == a5 && !(1 == a3))) || (((a27 == 1 && 1 == a5) && !(a12 == 1)) && !(a11 == 1))) || ((((1 == a5 && !(a12 == 1)) && a11 == 1) && !(1 == a6)) && a26 == 1)) || (1 == a5 && a27 <= 0)) || ((1 == a5 && a27 == 1) && a26 == 1)) || (((1 == a5 && a27 == 1) && !(a12 == 1)) && !(1 == a6)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: SAFE, OverallTime: 23.1s, OverallIterations: 13, TraceHistogramMax: 4, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, HoareTripleCheckerStatistics: 1667 SDtfs, 1967 SDslu, 95 SDs, 0 SdLazy, 7790 SolverSat, 1754 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2351 GetRequests, 2312 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13588occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 8723 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 236 NumberOfFragments, 183 HoareAnnotationTreeSize, 3 FomulaSimplifications, 9620 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 8452 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 4235 NumberOfCodeBlocks, 4235 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 5369 ConstructedInterpolants, 0 QuantifiedInterpolants, 3170313 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2191 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 21 InterpolantComputations, 17 PerfectInterpolantSequences, 3337/3360 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...