./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label48.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9b50b059-bb00-4013-bc56-5ac8156cbe3d/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9b50b059-bb00-4013-bc56-5ac8156cbe3d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9b50b059-bb00-4013-bc56-5ac8156cbe3d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9b50b059-bb00-4013-bc56-5ac8156cbe3d/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label48.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9b50b059-bb00-4013-bc56-5ac8156cbe3d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9b50b059-bb00-4013-bc56-5ac8156cbe3d/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 0efda15f8357629016064e69e444205aff537305 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 15:50:19,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:50:19,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:50:19,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:50:19,461 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:50:19,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:50:19,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:50:19,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:50:19,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:50:19,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:50:19,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:50:19,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:50:19,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:50:19,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:50:19,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:50:19,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:50:19,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:50:19,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:50:19,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:50:19,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:50:19,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:50:19,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:50:19,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:50:19,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:50:19,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:50:19,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:50:19,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:50:19,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:50:19,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:50:19,479 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:50:19,479 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:50:19,480 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:50:19,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:50:19,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:50:19,481 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:50:19,481 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:50:19,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:50:19,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:50:19,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:50:19,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:50:19,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:50:19,483 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9b50b059-bb00-4013-bc56-5ac8156cbe3d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 15:50:19,493 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:50:19,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:50:19,494 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 15:50:19,494 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 15:50:19,494 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 15:50:19,494 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 15:50:19,495 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 15:50:19,495 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 15:50:19,495 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 15:50:19,495 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 15:50:19,495 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 15:50:19,495 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 15:50:19,495 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 15:50:19,495 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 15:50:19,496 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 15:50:19,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:50:19,496 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:50:19,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:50:19,496 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:50:19,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:50:19,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:50:19,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:50:19,497 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:50:19,497 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 15:50:19,497 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:50:19,497 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:50:19,497 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:50:19,497 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:50:19,498 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:50:19,498 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:50:19,498 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:50:19,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:50:19,498 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:50:19,498 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:50:19,498 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:50:19,499 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 15:50:19,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:50:19,499 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:50:19,499 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:50:19,499 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 15:50:19,499 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_9b50b059-bb00-4013-bc56-5ac8156cbe3d/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 -> 0efda15f8357629016064e69e444205aff537305 [2019-12-07 15:50:19,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:50:19,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:50:19,610 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:50:19,611 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:50:19,612 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:50:19,612 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9b50b059-bb00-4013-bc56-5ac8156cbe3d/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label48.c [2019-12-07 15:50:19,655 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9b50b059-bb00-4013-bc56-5ac8156cbe3d/bin/utaipan/data/299bba33a/2fcc5ac19fd84345b94f56e05ad57404/FLAGc4b2711f4 [2019-12-07 15:50:20,026 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:50:20,026 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9b50b059-bb00-4013-bc56-5ac8156cbe3d/sv-benchmarks/c/eca-rers2012/Problem01_label48.c [2019-12-07 15:50:20,034 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9b50b059-bb00-4013-bc56-5ac8156cbe3d/bin/utaipan/data/299bba33a/2fcc5ac19fd84345b94f56e05ad57404/FLAGc4b2711f4 [2019-12-07 15:50:20,043 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9b50b059-bb00-4013-bc56-5ac8156cbe3d/bin/utaipan/data/299bba33a/2fcc5ac19fd84345b94f56e05ad57404 [2019-12-07 15:50:20,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:50:20,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:50:20,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:50:20,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:50:20,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:50:20,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:50:20" (1/1) ... [2019-12-07 15:50:20,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cc73ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:50:20, skipping insertion in model container [2019-12-07 15:50:20,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:50:20" (1/1) ... [2019-12-07 15:50:20,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:50:20,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:50:20,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:50:20,339 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:50:20,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:50:20,407 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:50:20,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:50:20 WrapperNode [2019-12-07 15:50:20,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:50:20,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:50:20,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:50:20,408 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:50:20,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:50:20" (1/1) ... [2019-12-07 15:50:20,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:50:20" (1/1) ... [2019-12-07 15:50:20,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:50:20,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:50:20,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:50:20,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:50:20,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:50:20" (1/1) ... [2019-12-07 15:50:20,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:50:20" (1/1) ... [2019-12-07 15:50:20,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:50:20" (1/1) ... [2019-12-07 15:50:20,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:50:20" (1/1) ... [2019-12-07 15:50:20,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:50:20" (1/1) ... [2019-12-07 15:50:20,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:50:20" (1/1) ... [2019-12-07 15:50:20,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:50:20" (1/1) ... [2019-12-07 15:50:20,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:50:20,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:50:20,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:50:20,502 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:50:20,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:50:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b50b059-bb00-4013-bc56-5ac8156cbe3d/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:50:20,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:50:20,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:50:21,645 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:50:21,646 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 15:50:21,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:50:21 BoogieIcfgContainer [2019-12-07 15:50:21,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:50:21,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:50:21,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:50:21,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:50:21,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:50:20" (1/3) ... [2019-12-07 15:50:21,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f2d43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:50:21, skipping insertion in model container [2019-12-07 15:50:21,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:50:20" (2/3) ... [2019-12-07 15:50:21,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f2d43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:50:21, skipping insertion in model container [2019-12-07 15:50:21,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:50:21" (3/3) ... [2019-12-07 15:50:21,654 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label48.c [2019-12-07 15:50:21,661 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:50:21,666 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 15:50:21,676 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 15:50:21,695 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:50:21,695 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:50:21,695 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:50:21,695 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:50:21,696 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:50:21,696 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:50:21,696 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:50:21,696 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:50:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-12-07 15:50:21,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 15:50:21,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:50:21,714 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:50:21,714 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:50:21,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:50:21,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1323231385, now seen corresponding path program 1 times [2019-12-07 15:50:21,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:50:21,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157150483] [2019-12-07 15:50:21,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:50:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:50:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:50:21,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157150483] [2019-12-07 15:50:21,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:50:21,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:50:21,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528924625] [2019-12-07 15:50:21,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:50:21,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:50:21,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:50:21,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:50:21,986 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-12-07 15:50:22,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:50:22,398 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-12-07 15:50:22,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:50:22,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-07 15:50:22,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:50:22,409 INFO L225 Difference]: With dead ends: 297 [2019-12-07 15:50:22,409 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 15:50:22,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:50:22,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 15:50:22,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-12-07 15:50:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-07 15:50:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 396 transitions. [2019-12-07 15:50:22,449 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 396 transitions. Word has length 71 [2019-12-07 15:50:22,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:50:22,450 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 396 transitions. [2019-12-07 15:50:22,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:50:22,450 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 396 transitions. [2019-12-07 15:50:22,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 15:50:22,453 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:50:22,453 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:50:22,453 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:50:22,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:50:22,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1566176565, now seen corresponding path program 1 times [2019-12-07 15:50:22,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:50:22,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87798470] [2019-12-07 15:50:22,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:50:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:50:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:50:22,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87798470] [2019-12-07 15:50:22,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:50:22,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:50:22,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151460313] [2019-12-07 15:50:22,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:50:22,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:50:22,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:50:22,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:50:22,499 INFO L87 Difference]: Start difference. First operand 216 states and 396 transitions. Second operand 3 states. [2019-12-07 15:50:22,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:50:22,724 INFO L93 Difference]: Finished difference Result 644 states and 1185 transitions. [2019-12-07 15:50:22,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:50:22,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 15:50:22,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:50:22,728 INFO L225 Difference]: With dead ends: 644 [2019-12-07 15:50:22,728 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 15:50:22,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:50:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 15:50:22,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 358. [2019-12-07 15:50:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-12-07 15:50:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 587 transitions. [2019-12-07 15:50:22,746 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 587 transitions. Word has length 84 [2019-12-07 15:50:22,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:50:22,746 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 587 transitions. [2019-12-07 15:50:22,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:50:22,746 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 587 transitions. [2019-12-07 15:50:22,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 15:50:22,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:50:22,748 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:50:22,749 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:50:22,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:50:22,749 INFO L82 PathProgramCache]: Analyzing trace with hash -81009251, now seen corresponding path program 1 times [2019-12-07 15:50:22,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:50:22,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348022846] [2019-12-07 15:50:22,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:50:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:50:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 15:50:22,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348022846] [2019-12-07 15:50:22,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:50:22,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:50:22,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205697075] [2019-12-07 15:50:22,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:50:22,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:50:22,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:50:22,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:50:22,789 INFO L87 Difference]: Start difference. First operand 358 states and 587 transitions. Second operand 4 states. [2019-12-07 15:50:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:50:23,154 INFO L93 Difference]: Finished difference Result 1212 states and 2013 transitions. [2019-12-07 15:50:23,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:50:23,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-07 15:50:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:50:23,157 INFO L225 Difference]: With dead ends: 1212 [2019-12-07 15:50:23,158 INFO L226 Difference]: Without dead ends: 855 [2019-12-07 15:50:23,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:50:23,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-12-07 15:50:23,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 784. [2019-12-07 15:50:23,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-12-07 15:50:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1218 transitions. [2019-12-07 15:50:23,177 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1218 transitions. Word has length 93 [2019-12-07 15:50:23,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:50:23,177 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1218 transitions. [2019-12-07 15:50:23,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:50:23,177 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1218 transitions. [2019-12-07 15:50:23,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 15:50:23,179 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:50:23,179 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 15:50:23,179 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:50:23,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:50:23,180 INFO L82 PathProgramCache]: Analyzing trace with hash 2009843212, now seen corresponding path program 1 times [2019-12-07 15:50:23,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:50:23,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063802856] [2019-12-07 15:50:23,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:50:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:50:23,237 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 15:50:23,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063802856] [2019-12-07 15:50:23,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:50:23,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:50:23,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171488785] [2019-12-07 15:50:23,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:50:23,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:50:23,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:50:23,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:50:23,239 INFO L87 Difference]: Start difference. First operand 784 states and 1218 transitions. Second operand 4 states. [2019-12-07 15:50:23,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:50:23,506 INFO L93 Difference]: Finished difference Result 1655 states and 2541 transitions. [2019-12-07 15:50:23,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:50:23,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 15:50:23,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:50:23,511 INFO L225 Difference]: With dead ends: 1655 [2019-12-07 15:50:23,512 INFO L226 Difference]: Without dead ends: 872 [2019-12-07 15:50:23,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:50:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2019-12-07 15:50:23,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 855. [2019-12-07 15:50:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-12-07 15:50:23,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1295 transitions. [2019-12-07 15:50:23,538 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1295 transitions. Word has length 99 [2019-12-07 15:50:23,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:50:23,538 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1295 transitions. [2019-12-07 15:50:23,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:50:23,538 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1295 transitions. [2019-12-07 15:50:23,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 15:50:23,540 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:50:23,541 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2019-12-07 15:50:23,541 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:50:23,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:50:23,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1788102724, now seen corresponding path program 1 times [2019-12-07 15:50:23,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:50:23,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541457405] [2019-12-07 15:50:23,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:50:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:50:23,587 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 15:50:23,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541457405] [2019-12-07 15:50:23,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:50:23,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:50:23,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475654454] [2019-12-07 15:50:23,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:50:23,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:50:23,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:50:23,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:50:23,588 INFO L87 Difference]: Start difference. First operand 855 states and 1295 transitions. Second operand 4 states. [2019-12-07 15:50:23,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:50:23,931 INFO L93 Difference]: Finished difference Result 1780 states and 2732 transitions. [2019-12-07 15:50:23,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:50:23,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-07 15:50:23,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:50:23,935 INFO L225 Difference]: With dead ends: 1780 [2019-12-07 15:50:23,935 INFO L226 Difference]: Without dead ends: 997 [2019-12-07 15:50:23,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:50:23,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-12-07 15:50:23,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-12-07 15:50:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-12-07 15:50:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1473 transitions. [2019-12-07 15:50:23,953 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1473 transitions. Word has length 103 [2019-12-07 15:50:23,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:50:23,953 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1473 transitions. [2019-12-07 15:50:23,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:50:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1473 transitions. [2019-12-07 15:50:23,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 15:50:23,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:50:23,954 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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] [2019-12-07 15:50:23,955 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:50:23,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:50:23,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1752327103, now seen corresponding path program 1 times [2019-12-07 15:50:23,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:50:23,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377545076] [2019-12-07 15:50:23,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:50:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:50:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 15:50:23,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377545076] [2019-12-07 15:50:23,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:50:23,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:50:23,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361739131] [2019-12-07 15:50:23,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:50:23,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:50:23,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:50:23,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:50:23,990 INFO L87 Difference]: Start difference. First operand 997 states and 1473 transitions. Second operand 3 states. [2019-12-07 15:50:24,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:50:24,291 INFO L93 Difference]: Finished difference Result 2348 states and 3536 transitions. [2019-12-07 15:50:24,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:50:24,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-12-07 15:50:24,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:50:24,298 INFO L225 Difference]: With dead ends: 2348 [2019-12-07 15:50:24,298 INFO L226 Difference]: Without dead ends: 1281 [2019-12-07 15:50:24,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:50:24,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-12-07 15:50:24,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1068. [2019-12-07 15:50:24,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-12-07 15:50:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1345 transitions. [2019-12-07 15:50:24,326 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1345 transitions. Word has length 106 [2019-12-07 15:50:24,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:50:24,326 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1345 transitions. [2019-12-07 15:50:24,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:50:24,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1345 transitions. [2019-12-07 15:50:24,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 15:50:24,329 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:50:24,329 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 15:50:24,329 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:50:24,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:50:24,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1472781405, now seen corresponding path program 1 times [2019-12-07 15:50:24,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:50:24,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660934790] [2019-12-07 15:50:24,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:50:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:50:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:50:24,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660934790] [2019-12-07 15:50:24,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:50:24,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:50:24,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962513080] [2019-12-07 15:50:24,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:50:24,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:50:24,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:50:24,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:50:24,395 INFO L87 Difference]: Start difference. First operand 1068 states and 1345 transitions. Second operand 5 states. [2019-12-07 15:50:24,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:50:24,825 INFO L93 Difference]: Finished difference Result 2845 states and 3664 transitions. [2019-12-07 15:50:24,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:50:24,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-12-07 15:50:24,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:50:24,832 INFO L225 Difference]: With dead ends: 2845 [2019-12-07 15:50:24,832 INFO L226 Difference]: Without dead ends: 1849 [2019-12-07 15:50:24,834 INFO L630 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-12-07 15:50:24,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2019-12-07 15:50:24,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1494. [2019-12-07 15:50:24,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2019-12-07 15:50:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1818 transitions. [2019-12-07 15:50:24,861 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1818 transitions. Word has length 121 [2019-12-07 15:50:24,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:50:24,862 INFO L462 AbstractCegarLoop]: Abstraction has 1494 states and 1818 transitions. [2019-12-07 15:50:24,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:50:24,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1818 transitions. [2019-12-07 15:50:24,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-12-07 15:50:24,864 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:50:24,865 INFO L410 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, 4, 4, 4, 4, 3, 3, 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] [2019-12-07 15:50:24,865 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:50:24,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:50:24,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1906081643, now seen corresponding path program 1 times [2019-12-07 15:50:24,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:50:24,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433154818] [2019-12-07 15:50:24,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:50:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:50:24,974 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 173 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 15:50:24,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433154818] [2019-12-07 15:50:24,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103499111] [2019-12-07 15:50:24,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b50b059-bb00-4013-bc56-5ac8156cbe3d/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:50:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:50:25,060 INFO L264 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 15:50:25,069 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:50:25,137 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-12-07 15:50:25,137 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:50:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-12-07 15:50:25,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:50:25,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-12-07 15:50:25,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202041463] [2019-12-07 15:50:25,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:50:25,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:50:25,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:50:25,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:50:25,178 INFO L87 Difference]: Start difference. First operand 1494 states and 1818 transitions. Second operand 3 states. [2019-12-07 15:50:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:50:25,400 INFO L93 Difference]: Finished difference Result 2987 states and 3655 transitions. [2019-12-07 15:50:25,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:50:25,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-12-07 15:50:25,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:50:25,408 INFO L225 Difference]: With dead ends: 2987 [2019-12-07 15:50:25,409 INFO L226 Difference]: Without dead ends: 1494 [2019-12-07 15:50:25,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 372 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-12-07 15:50:25,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2019-12-07 15:50:25,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1352. [2019-12-07 15:50:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-12-07 15:50:25,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1563 transitions. [2019-12-07 15:50:25,445 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1563 transitions. Word has length 187 [2019-12-07 15:50:25,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:50:25,445 INFO L462 AbstractCegarLoop]: Abstraction has 1352 states and 1563 transitions. [2019-12-07 15:50:25,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:50:25,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1563 transitions. [2019-12-07 15:50:25,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-07 15:50:25,449 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:50:25,449 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 15:50:25,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:50:25,650 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:50:25,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:50:25,650 INFO L82 PathProgramCache]: Analyzing trace with hash -495695403, now seen corresponding path program 1 times [2019-12-07 15:50:25,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:50:25,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987962151] [2019-12-07 15:50:25,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:50:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:50:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-12-07 15:50:25,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987962151] [2019-12-07 15:50:25,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:50:25,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:50:25,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142369966] [2019-12-07 15:50:25,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:50:25,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:50:25,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:50:25,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:50:25,743 INFO L87 Difference]: Start difference. First operand 1352 states and 1563 transitions. Second operand 4 states. [2019-12-07 15:50:25,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:50:25,990 INFO L93 Difference]: Finished difference Result 2845 states and 3320 transitions. [2019-12-07 15:50:25,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:50:25,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-12-07 15:50:25,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:50:25,995 INFO L225 Difference]: With dead ends: 2845 [2019-12-07 15:50:25,995 INFO L226 Difference]: Without dead ends: 1494 [2019-12-07 15:50:25,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:50:25,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2019-12-07 15:50:26,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1281. [2019-12-07 15:50:26,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1281 states. [2019-12-07 15:50:26,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1480 transitions. [2019-12-07 15:50:26,018 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1480 transitions. Word has length 190 [2019-12-07 15:50:26,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:50:26,018 INFO L462 AbstractCegarLoop]: Abstraction has 1281 states and 1480 transitions. [2019-12-07 15:50:26,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:50:26,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1480 transitions. [2019-12-07 15:50:26,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-12-07 15:50:26,021 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:50:26,021 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:50:26,022 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:50:26,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:50:26,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1290832554, now seen corresponding path program 1 times [2019-12-07 15:50:26,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:50:26,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221364146] [2019-12-07 15:50:26,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:50:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:50:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 233 proven. 27 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 15:50:26,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221364146] [2019-12-07 15:50:26,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919373877] [2019-12-07 15:50:26,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9b50b059-bb00-4013-bc56-5ac8156cbe3d/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:50:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:50:26,209 INFO L264 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 15:50:26,213 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:50:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-12-07 15:50:26,264 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:50:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-12-07 15:50:26,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:50:26,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-12-07 15:50:26,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166735302] [2019-12-07 15:50:26,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:50:26,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:50:26,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:50:26,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:50:26,295 INFO L87 Difference]: Start difference. First operand 1281 states and 1480 transitions. Second operand 3 states. [2019-12-07 15:50:26,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:50:26,504 INFO L93 Difference]: Finished difference Result 2701 states and 3121 transitions. [2019-12-07 15:50:26,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:50:26,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-12-07 15:50:26,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:50:26,505 INFO L225 Difference]: With dead ends: 2701 [2019-12-07 15:50:26,505 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 15:50:26,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 424 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:50:26,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 15:50:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 15:50:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 15:50:26,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 15:50:26,508 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2019-12-07 15:50:26,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:50:26,509 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 15:50:26,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:50:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 15:50:26,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 15:50:26,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:50:26,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 15:50:27,186 WARN L192 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-12-07 15:50:27,598 WARN L192 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-12-07 15:50:27,600 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-12-07 15:50:27,600 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-12-07 15:50:27,600 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-12-07 15:50:27,600 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-12-07 15:50:27,600 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-12-07 15:50:27,601 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-12-07 15:50:27,601 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 15:50:27,601 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-12-07 15:50:27,601 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-12-07 15:50:27,601 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-12-07 15:50:27,601 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-12-07 15:50:27,601 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-12-07 15:50:27,601 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-12-07 15:50:27,601 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-12-07 15:50:27,601 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-12-07 15:50:27,601 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 15:50:27,601 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-12-07 15:50:27,601 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-12-07 15:50:27,601 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-12-07 15:50:27,602 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-12-07 15:50:27,602 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse7 (= 15 ~a8~0)) (.cse5 (<= ~a20~0 0)) (.cse3 (<= ~a16~0 4)) (.cse4 (= 1 ~a7~0)) (.cse0 (= ~a17~0 1)) (.cse9 (not (= 14 ~a8~0))) (.cse6 (= ~a16~0 5)) (.cse11 (<= 14 ~a8~0)) (.cse8 (not (= ~a16~0 6))) (.cse10 (<= ~a17~0 0)) (.cse2 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse7 .cse6) (and .cse4 .cse3) (and .cse4 .cse8 .cse0 .cse9 .cse1) (and .cse10 .cse2 .cse3) (and .cse11 .cse0 .cse9 .cse1 .cse5) (and .cse11 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse2) (and .cse2 .cse7 (not .cse0)) (and .cse7 .cse5) (and .cse4 .cse10 .cse9 .cse2) (and .cse5 .cse3) (and .cse4 .cse0 .cse9 .cse2 .cse6) (and .cse11 .cse8 .cse10 .cse2))) [2019-12-07 15:50:27,602 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-12-07 15:50:27,602 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-12-07 15:50:27,602 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-12-07 15:50:27,602 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-12-07 15:50:27,602 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-12-07 15:50:27,602 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-12-07 15:50:27,602 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-12-07 15:50:27,602 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-12-07 15:50:27,603 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-12-07 15:50:27,603 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-12-07 15:50:27,603 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-12-07 15:50:27,603 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-12-07 15:50:27,603 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-12-07 15:50:27,603 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-12-07 15:50:27,603 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-12-07 15:50:27,603 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-12-07 15:50:27,603 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 15:50:27,603 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-12-07 15:50:27,603 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-12-07 15:50:27,603 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-12-07 15:50:27,603 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-12-07 15:50:27,603 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-12-07 15:50:27,603 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-12-07 15:50:27,604 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse7 (= 15 ~a8~0)) (.cse5 (<= ~a20~0 0)) (.cse3 (<= ~a16~0 4)) (.cse4 (= 1 ~a7~0)) (.cse0 (= ~a17~0 1)) (.cse9 (not (= 14 ~a8~0))) (.cse6 (= ~a16~0 5)) (.cse11 (<= 14 ~a8~0)) (.cse8 (not (= ~a16~0 6))) (.cse10 (<= ~a17~0 0)) (.cse2 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse7 .cse6) (and .cse4 .cse3) (and .cse4 .cse8 .cse0 .cse9 .cse1) (and .cse10 .cse2 .cse3) (and .cse11 .cse0 .cse9 .cse1 .cse5) (and .cse11 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse2) (and .cse2 .cse7 (not .cse0)) (and .cse7 .cse5) (and .cse4 .cse10 .cse9 .cse2) (and .cse5 .cse3) (and .cse4 .cse0 .cse9 .cse2 .cse6) (and .cse11 .cse8 .cse10 .cse2))) [2019-12-07 15:50:27,604 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-12-07 15:50:27,604 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-12-07 15:50:27,604 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-12-07 15:50:27,604 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-12-07 15:50:27,604 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 15:50:27,604 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-12-07 15:50:27,604 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-12-07 15:50:27,604 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-12-07 15:50:27,604 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-12-07 15:50:27,604 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-12-07 15:50:27,604 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-12-07 15:50:27,605 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-12-07 15:50:27,605 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-12-07 15:50:27,605 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-12-07 15:50:27,605 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-12-07 15:50:27,605 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-12-07 15:50:27,605 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-12-07 15:50:27,605 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-12-07 15:50:27,605 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-12-07 15:50:27,605 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-12-07 15:50:27,605 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-12-07 15:50:27,605 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-12-07 15:50:27,605 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-12-07 15:50:27,605 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 539) no Hoare annotation was computed. [2019-12-07 15:50:27,605 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-12-07 15:50:27,605 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-12-07 15:50:27,606 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-12-07 15:50:27,606 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-12-07 15:50:27,606 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-12-07 15:50:27,606 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-12-07 15:50:27,606 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-12-07 15:50:27,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:50:27 BoogieIcfgContainer [2019-12-07 15:50:27,623 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:50:27,623 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:50:27,623 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:50:27,623 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:50:27,624 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:50:21" (3/4) ... [2019-12-07 15:50:27,626 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 15:50:27,643 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-12-07 15:50:27,644 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-12-07 15:50:27,646 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-12-07 15:50:27,647 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 15:50:27,750 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9b50b059-bb00-4013-bc56-5ac8156cbe3d/bin/utaipan/witness.graphml [2019-12-07 15:50:27,750 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:50:27,752 INFO L168 Benchmark]: Toolchain (without parser) took 7705.73 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 229.6 MB). Free memory was 937.1 MB in the beginning and 829.6 MB in the end (delta: 107.5 MB). Peak memory consumption was 337.1 MB. Max. memory is 11.5 GB. [2019-12-07 15:50:27,752 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:50:27,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -144.4 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:50:27,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.34 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:50:27,753 INFO L168 Benchmark]: Boogie Preprocessor took 39.31 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:50:27,753 INFO L168 Benchmark]: RCFGBuilder took 1145.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 862.5 MB in the end (delta: 208.3 MB). Peak memory consumption was 208.3 MB. Max. memory is 11.5 GB. [2019-12-07 15:50:27,754 INFO L168 Benchmark]: TraceAbstraction took 5974.97 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 123.7 MB). Free memory was 862.5 MB in the beginning and 848.5 MB in the end (delta: 13.9 MB). Peak memory consumption was 137.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:50:27,754 INFO L168 Benchmark]: Witness Printer took 127.36 ms. Allocated memory is still 1.3 GB. Free memory was 848.5 MB in the beginning and 829.6 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-12-07 15:50:27,756 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 360.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -144.4 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.34 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.31 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1145.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 862.5 MB in the end (delta: 208.3 MB). Peak memory consumption was 208.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5974.97 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 123.7 MB). Free memory was 862.5 MB in the beginning and 848.5 MB in the end (delta: 13.9 MB). Peak memory consumption was 137.7 MB. Max. memory is 11.5 GB. * Witness Printer took 127.36 ms. Allocated memory is still 1.3 GB. Free memory was 848.5 MB in the beginning and 829.6 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 539]: 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: ((((((((((((((((a17 == 1 && a21 == 1) && a20 == 1) && a16 <= 4) || ((1 == a7 && a20 <= 0) && a16 == 5)) || ((1 == a7 && 15 == a8) && a16 == 5)) || (1 == a7 && a16 <= 4)) || ((((1 == a7 && !(a16 == 6)) && a17 == 1) && !(14 == a8)) && a21 == 1)) || ((a17 <= 0 && a20 == 1) && a16 <= 4)) || ((((14 <= a8 && a17 == 1) && !(14 == a8)) && a21 == 1) && a20 <= 0)) || ((14 <= a8 && a20 <= 0) && a16 == 5)) || (((a17 == 1 && !(14 == a8)) && a21 == 1) && a20 == 1)) || ((a20 == 1 && 15 == a8) && !(a17 == 1))) || (15 == a8 && a20 <= 0)) || (((1 == a7 && a17 <= 0) && !(14 == a8)) && a20 == 1)) || (a20 <= 0 && a16 <= 4)) || ((((1 == a7 && a17 == 1) && !(14 == a8)) && a20 == 1) && a16 == 5)) || (((14 <= a8 && !(a16 == 6)) && a17 <= 0) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((a17 == 1 && a21 == 1) && a20 == 1) && a16 <= 4) || ((1 == a7 && a20 <= 0) && a16 == 5)) || ((1 == a7 && 15 == a8) && a16 == 5)) || (1 == a7 && a16 <= 4)) || ((((1 == a7 && !(a16 == 6)) && a17 == 1) && !(14 == a8)) && a21 == 1)) || ((a17 <= 0 && a20 == 1) && a16 <= 4)) || ((((14 <= a8 && a17 == 1) && !(14 == a8)) && a21 == 1) && a20 <= 0)) || ((14 <= a8 && a20 <= 0) && a16 == 5)) || (((a17 == 1 && !(14 == a8)) && a21 == 1) && a20 == 1)) || ((a20 == 1 && 15 == a8) && !(a17 == 1))) || (15 == a8 && a20 <= 0)) || (((1 == a7 && a17 <= 0) && !(14 == a8)) && a20 == 1)) || (a20 <= 0 && a16 <= 4)) || ((((1 == a7 && a17 == 1) && !(14 == a8)) && a20 == 1) && a16 == 5)) || (((14 <= a8 && !(a16 == 6)) && a17 <= 0) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 5.0s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 598 SDtfs, 1081 SDslu, 68 SDs, 0 SdLazy, 2845 SolverSat, 790 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 837 GetRequests, 806 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1494occurred in iteration=7, 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, 1082 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 56 NumberOfFragments, 361 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2485 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1300 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1667 NumberOfCodeBlocks, 1667 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2053 ConstructedInterpolants, 0 QuantifiedInterpolants, 678218 SizeOfPredicates, 2 NumberOfNonLiveVariables, 887 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2218/2272 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...