./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b320a5fe-4aa0-49dd-97a1-184bb89656aa/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b320a5fe-4aa0-49dd-97a1-184bb89656aa/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b320a5fe-4aa0-49dd-97a1-184bb89656aa/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b320a5fe-4aa0-49dd-97a1-184bb89656aa/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label03.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b320a5fe-4aa0-49dd-97a1-184bb89656aa/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b320a5fe-4aa0-49dd-97a1-184bb89656aa/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 a91f469417fecfcde25fa5a52b02f071d3462166 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:26:19,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:26:19,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:26:19,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:26:19,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:26:19,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:26:19,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:26:19,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:26:19,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:26:19,984 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:26:19,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:26:19,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:26:19,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:26:19,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:26:19,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:26:19,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:26:19,989 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:26:19,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:26:19,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:26:19,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:26:20,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:26:20,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:26:20,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:26:20,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:26:20,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:26:20,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:26:20,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:26:20,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:26:20,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:26:20,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:26:20,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:26:20,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:26:20,006 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:26:20,007 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:26:20,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:26:20,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:26:20,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:26:20,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:26:20,008 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:26:20,009 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:26:20,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:26:20,010 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b320a5fe-4aa0-49dd-97a1-184bb89656aa/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:26:20,019 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:26:20,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:26:20,020 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:26:20,020 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:26:20,021 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:26:20,021 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:26:20,021 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:26:20,021 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:26:20,021 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:26:20,021 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:26:20,022 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:26:20,022 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:26:20,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:26:20,022 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:26:20,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:26:20,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:26:20,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:26:20,023 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:26:20,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:26:20,023 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:26:20,024 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:26:20,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:26:20,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:26:20,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:26:20,024 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:26:20,024 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:26:20,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:26:20,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:26:20,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:26:20,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:26:20,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:26:20,025 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:26:20,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:26:20,026 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:26:20,028 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:26:20,028 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/working_dir_b320a5fe-4aa0-49dd-97a1-184bb89656aa/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 -> a91f469417fecfcde25fa5a52b02f071d3462166 [2019-10-22 11:26:20,053 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:26:20,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:26:20,065 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:26:20,067 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:26:20,067 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:26:20,067 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b320a5fe-4aa0-49dd-97a1-184bb89656aa/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label03.c [2019-10-22 11:26:20,112 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b320a5fe-4aa0-49dd-97a1-184bb89656aa/bin/utaipan/data/1dcc444d9/cc20b84bcd0e4fdda9825b01044692b1/FLAGf077f9b0e [2019-10-22 11:26:20,565 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:26:20,566 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b320a5fe-4aa0-49dd-97a1-184bb89656aa/sv-benchmarks/c/eca-rers2012/Problem01_label03.c [2019-10-22 11:26:20,574 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b320a5fe-4aa0-49dd-97a1-184bb89656aa/bin/utaipan/data/1dcc444d9/cc20b84bcd0e4fdda9825b01044692b1/FLAGf077f9b0e [2019-10-22 11:26:20,881 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b320a5fe-4aa0-49dd-97a1-184bb89656aa/bin/utaipan/data/1dcc444d9/cc20b84bcd0e4fdda9825b01044692b1 [2019-10-22 11:26:20,883 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:26:20,884 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:26:20,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:20,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:26:20,888 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:26:20,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:20" (1/1) ... [2019-10-22 11:26:20,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ed3245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:20, skipping insertion in model container [2019-10-22 11:26:20,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:20" (1/1) ... [2019-10-22 11:26:20,900 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:26:20,950 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:26:21,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:21,385 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:26:21,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:21,508 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:26:21,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:21 WrapperNode [2019-10-22 11:26:21,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:21,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:21,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:26:21,510 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:26:21,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:21" (1/1) ... [2019-10-22 11:26:21,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:21" (1/1) ... [2019-10-22 11:26:21,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:21,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:26:21,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:26:21,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:26:21,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:21" (1/1) ... [2019-10-22 11:26:21,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:21" (1/1) ... [2019-10-22 11:26:21,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:21" (1/1) ... [2019-10-22 11:26:21,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:21" (1/1) ... [2019-10-22 11:26:21,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:21" (1/1) ... [2019-10-22 11:26:21,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:21" (1/1) ... [2019-10-22 11:26:21,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:21" (1/1) ... [2019-10-22 11:26:21,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:26:21,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:26:21,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:26:21,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:26:21,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b320a5fe-4aa0-49dd-97a1-184bb89656aa/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-10-22 11:26:21,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:26:21,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:26:22,704 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:26:22,704 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:26:22,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:22 BoogieIcfgContainer [2019-10-22 11:26:22,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:26:22,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:26:22,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:26:22,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:26:22,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:26:20" (1/3) ... [2019-10-22 11:26:22,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3556cb40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:22, skipping insertion in model container [2019-10-22 11:26:22,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:21" (2/3) ... [2019-10-22 11:26:22,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3556cb40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:22, skipping insertion in model container [2019-10-22 11:26:22,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:22" (3/3) ... [2019-10-22 11:26:22,712 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label03.c [2019-10-22 11:26:22,725 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:26:22,732 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:26:22,742 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:26:22,764 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:26:22,764 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:26:22,764 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:26:22,764 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:26:22,764 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:26:22,764 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:26:22,764 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:26:22,765 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:26:22,781 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-10-22 11:26:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-22 11:26:22,792 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:22,792 INFO L380 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] [2019-10-22 11:26:22,794 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:22,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:22,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1437018794, now seen corresponding path program 1 times [2019-10-22 11:26:22,805 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:22,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17515011] [2019-10-22 11:26:22,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:22,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:22,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:23,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:23,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17515011] [2019-10-22 11:26:23,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:23,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:26:23,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507409700] [2019-10-22 11:26:23,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:26:23,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:23,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:26:23,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:26:23,757 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 10 states. [2019-10-22 11:26:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:24,850 INFO L93 Difference]: Finished difference Result 493 states and 846 transitions. [2019-10-22 11:26:24,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:26:24,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2019-10-22 11:26:24,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:24,863 INFO L225 Difference]: With dead ends: 493 [2019-10-22 11:26:24,863 INFO L226 Difference]: Without dead ends: 193 [2019-10-22 11:26:24,866 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:26:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-22 11:26:24,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-10-22 11:26:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-10-22 11:26:24,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 264 transitions. [2019-10-22 11:26:24,909 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 264 transitions. Word has length 129 [2019-10-22 11:26:24,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:24,910 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 264 transitions. [2019-10-22 11:26:24,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:26:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 264 transitions. [2019-10-22 11:26:24,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-22 11:26:24,913 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:24,913 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:26:24,913 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:24,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:24,914 INFO L82 PathProgramCache]: Analyzing trace with hash 72009246, now seen corresponding path program 1 times [2019-10-22 11:26:24,914 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:24,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004025749] [2019-10-22 11:26:24,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:24,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:24,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:25,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004025749] [2019-10-22 11:26:25,016 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:25,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:25,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101443258] [2019-10-22 11:26:25,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:25,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:25,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:25,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:25,019 INFO L87 Difference]: Start difference. First operand 193 states and 264 transitions. Second operand 3 states. [2019-10-22 11:26:25,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:25,362 INFO L93 Difference]: Finished difference Result 457 states and 661 transitions. [2019-10-22 11:26:25,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:25,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-10-22 11:26:25,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:25,365 INFO L225 Difference]: With dead ends: 457 [2019-10-22 11:26:25,365 INFO L226 Difference]: Without dead ends: 324 [2019-10-22 11:26:25,366 INFO L600 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-10-22 11:26:25,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-10-22 11:26:25,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2019-10-22 11:26:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-10-22 11:26:25,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 443 transitions. [2019-10-22 11:26:25,392 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 443 transitions. Word has length 133 [2019-10-22 11:26:25,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:25,392 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 443 transitions. [2019-10-22 11:26:25,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:25,393 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 443 transitions. [2019-10-22 11:26:25,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-22 11:26:25,401 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:25,402 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:26:25,403 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:25,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:25,403 INFO L82 PathProgramCache]: Analyzing trace with hash -620681437, now seen corresponding path program 1 times [2019-10-22 11:26:25,403 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:25,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538918813] [2019-10-22 11:26:25,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:25,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:25,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:25,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538918813] [2019-10-22 11:26:25,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:25,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:25,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501007834] [2019-10-22 11:26:25,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:25,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:25,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:25,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:25,591 INFO L87 Difference]: Start difference. First operand 324 states and 443 transitions. Second operand 4 states. [2019-10-22 11:26:26,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:26,240 INFO L93 Difference]: Finished difference Result 814 states and 1161 transitions. [2019-10-22 11:26:26,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:26,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-22 11:26:26,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:26,243 INFO L225 Difference]: With dead ends: 814 [2019-10-22 11:26:26,243 INFO L226 Difference]: Without dead ends: 455 [2019-10-22 11:26:26,244 INFO L600 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-10-22 11:26:26,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-10-22 11:26:26,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2019-10-22 11:26:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-10-22 11:26:26,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 534 transitions. [2019-10-22 11:26:26,266 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 534 transitions. Word has length 136 [2019-10-22 11:26:26,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:26,266 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 534 transitions. [2019-10-22 11:26:26,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 534 transitions. [2019-10-22 11:26:26,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-22 11:26:26,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:26,269 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:26,269 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:26,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:26,269 INFO L82 PathProgramCache]: Analyzing trace with hash -647170395, now seen corresponding path program 1 times [2019-10-22 11:26:26,269 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:26,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547643758] [2019-10-22 11:26:26,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:26,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:26,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:26,315 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 11:26:26,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547643758] [2019-10-22 11:26:26,316 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:26,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:26,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357336210] [2019-10-22 11:26:26,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:26,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:26,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:26,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:26,318 INFO L87 Difference]: Start difference. First operand 455 states and 534 transitions. Second operand 3 states. [2019-10-22 11:26:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:26,593 INFO L93 Difference]: Finished difference Result 981 states and 1165 transitions. [2019-10-22 11:26:26,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:26,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-10-22 11:26:26,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:26,601 INFO L225 Difference]: With dead ends: 981 [2019-10-22 11:26:26,601 INFO L226 Difference]: Without dead ends: 586 [2019-10-22 11:26:26,601 INFO L600 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-10-22 11:26:26,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-22 11:26:26,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-10-22 11:26:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-22 11:26:26,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 677 transitions. [2019-10-22 11:26:26,614 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 677 transitions. Word has length 144 [2019-10-22 11:26:26,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:26,614 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 677 transitions. [2019-10-22 11:26:26,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:26,615 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 677 transitions. [2019-10-22 11:26:26,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-22 11:26:26,616 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:26,617 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-10-22 11:26:26,617 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:26,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:26,617 INFO L82 PathProgramCache]: Analyzing trace with hash -236489853, now seen corresponding path program 1 times [2019-10-22 11:26:26,617 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:26,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106648406] [2019-10-22 11:26:26,618 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:26,618 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:26,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:26:26,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106648406] [2019-10-22 11:26:26,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:26,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:26,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662735395] [2019-10-22 11:26:26,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:26,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:26,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:26,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:26,686 INFO L87 Difference]: Start difference. First operand 586 states and 677 transitions. Second operand 4 states. [2019-10-22 11:26:27,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:27,166 INFO L93 Difference]: Finished difference Result 2029 states and 2386 transitions. [2019-10-22 11:26:27,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:27,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-10-22 11:26:27,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:27,173 INFO L225 Difference]: With dead ends: 2029 [2019-10-22 11:26:27,173 INFO L226 Difference]: Without dead ends: 1503 [2019-10-22 11:26:27,174 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:27,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-10-22 11:26:27,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1241. [2019-10-22 11:26:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-10-22 11:26:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1461 transitions. [2019-10-22 11:26:27,202 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1461 transitions. Word has length 153 [2019-10-22 11:26:27,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:27,202 INFO L462 AbstractCegarLoop]: Abstraction has 1241 states and 1461 transitions. [2019-10-22 11:26:27,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:27,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1461 transitions. [2019-10-22 11:26:27,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-22 11:26:27,205 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:27,206 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 11:26:27,206 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:27,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:27,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1280194508, now seen corresponding path program 1 times [2019-10-22 11:26:27,206 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:27,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302169833] [2019-10-22 11:26:27,207 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:27,207 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:27,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:26:27,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302169833] [2019-10-22 11:26:27,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:27,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:27,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773427174] [2019-10-22 11:26:27,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:26:27,280 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:27,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:26:27,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:27,280 INFO L87 Difference]: Start difference. First operand 1241 states and 1461 transitions. Second operand 5 states. [2019-10-22 11:26:27,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:27,994 INFO L93 Difference]: Finished difference Result 2946 states and 3473 transitions. [2019-10-22 11:26:27,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:27,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-10-22 11:26:27,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:27,999 INFO L225 Difference]: With dead ends: 2946 [2019-10-22 11:26:27,999 INFO L226 Difference]: Without dead ends: 1765 [2019-10-22 11:26:28,000 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:28,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-10-22 11:26:28,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1634. [2019-10-22 11:26:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2019-10-22 11:26:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 1905 transitions. [2019-10-22 11:26:28,027 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 1905 transitions. Word has length 159 [2019-10-22 11:26:28,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:28,027 INFO L462 AbstractCegarLoop]: Abstraction has 1634 states and 1905 transitions. [2019-10-22 11:26:28,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:26:28,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 1905 transitions. [2019-10-22 11:26:28,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-22 11:26:28,035 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:28,036 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 11:26:28,036 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:28,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:28,036 INFO L82 PathProgramCache]: Analyzing trace with hash -73226021, now seen corresponding path program 1 times [2019-10-22 11:26:28,036 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:28,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822737104] [2019-10-22 11:26:28,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:28,037 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:28,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 11:26:28,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822737104] [2019-10-22 11:26:28,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:28,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:28,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313039701] [2019-10-22 11:26:28,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:28,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:28,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:28,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:28,122 INFO L87 Difference]: Start difference. First operand 1634 states and 1905 transitions. Second operand 3 states. [2019-10-22 11:26:28,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:28,450 INFO L93 Difference]: Finished difference Result 3732 states and 4372 transitions. [2019-10-22 11:26:28,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:28,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-10-22 11:26:28,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:28,455 INFO L225 Difference]: With dead ends: 3732 [2019-10-22 11:26:28,456 INFO L226 Difference]: Without dead ends: 2158 [2019-10-22 11:26:28,457 INFO L600 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-10-22 11:26:28,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2019-10-22 11:26:28,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2027. [2019-10-22 11:26:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2027 states. [2019-10-22 11:26:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2321 transitions. [2019-10-22 11:26:28,493 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2321 transitions. Word has length 193 [2019-10-22 11:26:28,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:28,494 INFO L462 AbstractCegarLoop]: Abstraction has 2027 states and 2321 transitions. [2019-10-22 11:26:28,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:28,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2321 transitions. [2019-10-22 11:26:28,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-22 11:26:28,498 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:28,498 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 11:26:28,498 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:28,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:28,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1876676455, now seen corresponding path program 1 times [2019-10-22 11:26:28,499 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:28,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743519010] [2019-10-22 11:26:28,500 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:28,500 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:28,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-22 11:26:28,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743519010] [2019-10-22 11:26:28,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803433160] [2019-10-22 11:26:28,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b320a5fe-4aa0-49dd-97a1-184bb89656aa/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-10-22 11:26:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:28,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:26:28,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-22 11:26:28,798 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-22 11:26:28,854 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:26:28,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-10-22 11:26:28,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699637880] [2019-10-22 11:26:28,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:28,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:28,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:28,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:26:28,856 INFO L87 Difference]: Start difference. First operand 2027 states and 2321 transitions. Second operand 3 states. [2019-10-22 11:26:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:29,243 INFO L93 Difference]: Finished difference Result 4911 states and 5667 transitions. [2019-10-22 11:26:29,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:29,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-10-22 11:26:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:29,250 INFO L225 Difference]: With dead ends: 4911 [2019-10-22 11:26:29,251 INFO L226 Difference]: Without dead ends: 2944 [2019-10-22 11:26:29,253 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 442 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:26:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2019-10-22 11:26:29,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2813. [2019-10-22 11:26:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2813 states. [2019-10-22 11:26:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 3196 transitions. [2019-10-22 11:26:29,302 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 3196 transitions. Word has length 222 [2019-10-22 11:26:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:29,303 INFO L462 AbstractCegarLoop]: Abstraction has 2813 states and 3196 transitions. [2019-10-22 11:26:29,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 3196 transitions. [2019-10-22 11:26:29,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-22 11:26:29,308 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:29,308 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-22 11:26:29,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:26:29,509 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:29,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:29,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1376312779, now seen corresponding path program 1 times [2019-10-22 11:26:29,510 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:29,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012280593] [2019-10-22 11:26:29,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:29,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:29,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 140 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:29,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012280593] [2019-10-22 11:26:29,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257040246] [2019-10-22 11:26:29,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b320a5fe-4aa0-49dd-97a1-184bb89656aa/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-10-22 11:26:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:29,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:26:29,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-22 11:26:29,972 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:30,017 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-22 11:26:30,017 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:26:30,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2019-10-22 11:26:30,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53196772] [2019-10-22 11:26:30,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:30,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:30,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:30,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:26:30,020 INFO L87 Difference]: Start difference. First operand 2813 states and 3196 transitions. Second operand 3 states. [2019-10-22 11:26:30,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:30,355 INFO L93 Difference]: Finished difference Result 5959 states and 6757 transitions. [2019-10-22 11:26:30,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:30,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-10-22 11:26:30,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:30,364 INFO L225 Difference]: With dead ends: 5959 [2019-10-22 11:26:30,364 INFO L226 Difference]: Without dead ends: 3206 [2019-10-22 11:26:30,366 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 447 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:26:30,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2019-10-22 11:26:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 2551. [2019-10-22 11:26:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2551 states. [2019-10-22 11:26:30,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 2897 transitions. [2019-10-22 11:26:30,415 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 2897 transitions. Word has length 225 [2019-10-22 11:26:30,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:30,416 INFO L462 AbstractCegarLoop]: Abstraction has 2551 states and 2897 transitions. [2019-10-22 11:26:30,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:30,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 2897 transitions. [2019-10-22 11:26:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-22 11:26:30,422 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:30,422 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-10-22 11:26:30,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:26:30,623 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:30,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:30,623 INFO L82 PathProgramCache]: Analyzing trace with hash -605874139, now seen corresponding path program 1 times [2019-10-22 11:26:30,623 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:30,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520062141] [2019-10-22 11:26:30,625 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:30,625 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:30,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 157 proven. 27 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 11:26:30,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520062141] [2019-10-22 11:26:30,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428906608] [2019-10-22 11:26:30,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b320a5fe-4aa0-49dd-97a1-184bb89656aa/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-10-22 11:26:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:30,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:26:30,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-22 11:26:30,966 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-22 11:26:31,007 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:26:31,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-10-22 11:26:31,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11764673] [2019-10-22 11:26:31,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:31,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:31,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:31,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:26:31,008 INFO L87 Difference]: Start difference. First operand 2551 states and 2897 transitions. Second operand 3 states. [2019-10-22 11:26:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:31,343 INFO L93 Difference]: Finished difference Result 4385 states and 4987 transitions. [2019-10-22 11:26:31,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:31,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-10-22 11:26:31,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:31,344 INFO L225 Difference]: With dead ends: 4385 [2019-10-22 11:26:31,344 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:26:31,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 460 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:26:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:26:31,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:26:31,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:26:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:26:31,348 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 231 [2019-10-22 11:26:31,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:31,348 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:26:31,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:26:31,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:26:31,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:26:31,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:26:31,752 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-22 11:26:31,753 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-22 11:26:31,753 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,753 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,753 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,753 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,753 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,753 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,753 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-22 11:26:31,753 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-22 11:26:31,753 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-10-22 11:26:31,753 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-10-22 11:26:31,753 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-10-22 11:26:31,754 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-10-22 11:26:31,754 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-10-22 11:26:31,754 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-10-22 11:26:31,754 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-22 11:26:31,754 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-22 11:26:31,754 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,754 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,754 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,754 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,754 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,756 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,756 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-22 11:26:31,756 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-22 11:26:31,756 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-10-22 11:26:31,756 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-10-22 11:26:31,756 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-10-22 11:26:31,756 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-10-22 11:26:31,756 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-10-22 11:26:31,756 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-10-22 11:26:31,756 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-22 11:26:31,756 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-22 11:26:31,757 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-22 11:26:31,757 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-22 11:26:31,757 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-22 11:26:31,757 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-22 11:26:31,757 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-10-22 11:26:31,757 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,757 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,757 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,757 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,757 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,757 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-22 11:26:31,757 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-22 11:26:31,757 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-10-22 11:26:31,757 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-10-22 11:26:31,758 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-10-22 11:26:31,758 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-10-22 11:26:31,758 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-10-22 11:26:31,758 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-10-22 11:26:31,758 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-22 11:26:31,758 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse4 (not (= ~a16~0 6))) (.cse0 (= ~a21~0 1)) (.cse1 (= ~a20~0 1)) (.cse3 (not (= ~a7~0 1))) (.cse2 (<= 14 ~a8~0)) (.cse5 (<= ~a20~0 0))) (or (and (= ~a16~0 4) (= ~a8~0 13) (= ~a17~0 1) (= ~a12~0 8) .cse0 .cse1) (and .cse2 .cse0 .cse1 (= ~a16~0 5)) (<= ~a21~0 0) (and .cse3 .cse4 .cse5) (and .cse2 .cse4 .cse5) (and .cse3 .cse0 .cse1) (and .cse3 .cse2 .cse5))) [2019-10-22 11:26:31,758 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,758 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,758 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,759 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,759 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,759 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-22 11:26:31,759 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-10-22 11:26:31,759 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-10-22 11:26:31,759 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-10-22 11:26:31,759 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-10-22 11:26:31,759 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-10-22 11:26:31,759 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-22 11:26:31,759 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 563) no Hoare annotation was computed. [2019-10-22 11:26:31,759 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-22 11:26:31,759 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-22 11:26:31,760 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-22 11:26:31,760 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-22 11:26:31,760 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-22 11:26:31,760 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-22 11:26:31,760 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-10-22 11:26:31,760 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,760 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,760 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,760 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,760 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,760 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-22 11:26:31,760 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-22 11:26:31,760 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-22 11:26:31,760 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-10-22 11:26:31,761 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-10-22 11:26:31,761 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-10-22 11:26:31,761 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-10-22 11:26:31,761 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-10-22 11:26:31,761 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-22 11:26:31,761 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,761 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,761 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,761 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,761 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-22 11:26:31,761 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,761 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-22 11:26:31,761 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-22 11:26:31,761 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-10-22 11:26:31,762 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-10-22 11:26:31,762 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-10-22 11:26:31,762 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-10-22 11:26:31,762 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-10-22 11:26:31,762 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:26:31,762 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-22 11:26:31,762 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-22 11:26:31,762 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-22 11:26:31,762 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-22 11:26:31,762 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-22 11:26:31,768 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-22 11:26:31,768 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,768 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse4 (not (= ~a16~0 6))) (.cse0 (= ~a21~0 1)) (.cse1 (= ~a20~0 1)) (.cse3 (not (= ~a7~0 1))) (.cse2 (<= 14 ~a8~0)) (.cse5 (<= ~a20~0 0))) (or (and (= ~a16~0 4) (= ~a8~0 13) (= ~a17~0 1) (= ~a12~0 8) .cse0 .cse1) (and .cse2 .cse0 .cse1 (= ~a16~0 5)) (<= ~a21~0 0) (and .cse3 .cse4 .cse5) (and .cse2 .cse4 .cse5) (and .cse3 .cse0 .cse1) (and .cse3 .cse2 .cse5))) [2019-10-22 11:26:31,768 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,768 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,768 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,768 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,769 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-22 11:26:31,769 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-10-22 11:26:31,769 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-10-22 11:26:31,769 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-10-22 11:26:31,769 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-10-22 11:26:31,769 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-10-22 11:26:31,769 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-22 11:26:31,769 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-22 11:26:31,769 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,769 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,769 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,769 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,769 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,769 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-22 11:26:31,769 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:26:31,770 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-22 11:26:31,770 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-22 11:26:31,770 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-22 11:26:31,770 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-10-22 11:26:31,770 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-10-22 11:26:31,770 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-10-22 11:26:31,770 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-10-22 11:26:31,770 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-10-22 11:26:31,770 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-22 11:26:31,770 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-22 11:26:31,770 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-22 11:26:31,770 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,770 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,770 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,770 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,771 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-10-22 11:26:31,771 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,771 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,771 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-22 11:26:31,771 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-22 11:26:31,771 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:26:31,771 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-10-22 11:26:31,771 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-10-22 11:26:31,771 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-10-22 11:26:31,771 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-10-22 11:26:31,771 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-10-22 11:26:31,771 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-10-22 11:26:31,771 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-22 11:26:31,771 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-22 11:26:31,771 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-22 11:26:31,772 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-22 11:26:31,772 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,772 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,772 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,772 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,772 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,772 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-22 11:26:31,772 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,772 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-22 11:26:31,772 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-22 11:26:31,772 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-10-22 11:26:31,772 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-10-22 11:26:31,772 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-10-22 11:26:31,772 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-10-22 11:26:31,772 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-10-22 11:26:31,773 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-10-22 11:26:31,773 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-22 11:26:31,773 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-22 11:26:31,773 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-22 11:26:31,773 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:26:31,773 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-22 11:26:31,773 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-22 11:26:31,773 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-22 11:26:31,773 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,773 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,773 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,773 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,773 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,773 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:26:31,773 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-22 11:26:31,774 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-10-22 11:26:31,774 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-10-22 11:26:31,774 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-10-22 11:26:31,774 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-10-22 11:26:31,774 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-10-22 11:26:31,774 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-10-22 11:26:31,774 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-22 11:26:31,774 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-22 11:26:31,774 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-22 11:26:31,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:26:31 BoogieIcfgContainer [2019-10-22 11:26:31,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:26:31,799 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:26:31,800 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:26:31,800 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:26:31,800 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:22" (3/4) ... [2019-10-22 11:26:31,803 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:26:31,823 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 11:26:31,823 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:26:31,941 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b320a5fe-4aa0-49dd-97a1-184bb89656aa/bin/utaipan/witness.graphml [2019-10-22 11:26:31,944 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:26:31,945 INFO L168 Benchmark]: Toolchain (without parser) took 11061.11 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 402.7 MB). Free memory was 944.5 MB in the beginning and 1.0 GB in the end (delta: -96.6 MB). Peak memory consumption was 306.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:31,946 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:31,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 624.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -149.2 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:31,947 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:31,947 INFO L168 Benchmark]: Boogie Preprocessor took 61.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:31,947 INFO L168 Benchmark]: RCFGBuilder took 1033.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 963.0 MB in the end (delta: 114.8 MB). Peak memory consumption was 114.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:31,947 INFO L168 Benchmark]: TraceAbstraction took 9092.34 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 284.7 MB). Free memory was 963.0 MB in the beginning and 1.1 GB in the end (delta: -94.6 MB). Peak memory consumption was 190.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:31,947 INFO L168 Benchmark]: Witness Printer took 144.42 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:31,949 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 624.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -149.2 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1033.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 963.0 MB in the end (delta: 114.8 MB). Peak memory consumption was 114.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9092.34 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 284.7 MB). Free memory was 963.0 MB in the beginning and 1.1 GB in the end (delta: -94.6 MB). Peak memory consumption was 190.1 MB. Max. memory is 11.5 GB. * Witness Printer took 144.42 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 563]: 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: 30]: Loop Invariant Derived loop invariant: ((((((((((a16 == 4 && a8 == 13) && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1) || (((14 <= a8 && a21 == 1) && a20 == 1) && a16 == 5)) || a21 <= 0) || ((!(a7 == 1) && !(a16 == 6)) && a20 <= 0)) || ((14 <= a8 && !(a16 == 6)) && a20 <= 0)) || ((!(a7 == 1) && a21 == 1) && a20 == 1)) || ((!(a7 == 1) && 14 <= a8) && a20 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((a16 == 4 && a8 == 13) && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1) || (((14 <= a8 && a21 == 1) && a20 == 1) && a16 == 5)) || a21 <= 0) || ((!(a7 == 1) && !(a16 == 6)) && a20 <= 0)) || ((14 <= a8 && !(a16 == 6)) && a20 <= 0)) || ((!(a7 == 1) && a21 == 1) && a20 == 1)) || ((!(a7 == 1) && 14 <= a8) && a20 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 9.0s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 844 SDtfs, 1553 SDslu, 95 SDs, 0 SdLazy, 4356 SolverSat, 617 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1409 GetRequests, 1362 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2813occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 1310 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 36 NumberOfFragments, 163 HoareAnnotationTreeSize, 3 FomulaSimplifications, 901 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 26 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2403 NumberOfCodeBlocks, 2403 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3065 ConstructedInterpolants, 0 QuantifiedInterpolants, 2210939 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1171 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 1836/1931 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...