./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label48.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b54c36a3-d47a-4662-9455-773789b7dd26/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b54c36a3-d47a-4662-9455-773789b7dd26/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b54c36a3-d47a-4662-9455-773789b7dd26/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b54c36a3-d47a-4662-9455-773789b7dd26/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label48.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b54c36a3-d47a-4662-9455-773789b7dd26/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b54c36a3-d47a-4662-9455-773789b7dd26/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 ed0ef8676714c03e409913657b72922b069856bc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:24:46,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:46,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:46,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:46,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:46,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:46,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:46,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:46,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:46,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:46,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:46,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:46,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:46,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:46,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:46,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:46,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:46,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:46,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:46,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:46,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:46,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:46,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:46,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:46,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:46,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:46,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:46,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:46,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:46,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:46,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:46,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:46,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:46,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:46,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:46,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:46,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:46,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:46,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:46,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:46,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:46,427 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b54c36a3-d47a-4662-9455-773789b7dd26/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:24:46,437 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:46,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:46,438 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:46,438 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:46,438 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:46,439 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:46,439 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:24:46,439 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:46,439 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:46,439 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:24:46,439 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:24:46,440 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:46,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:46,440 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:46,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:24:46,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:46,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:46,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:24:46,441 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:46,441 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:24:46,441 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:46,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:24:46,442 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:24:46,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:46,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:46,443 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:46,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:46,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:46,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:46,443 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:46,444 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:24:46,444 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:24:46,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:24:46,444 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:24:46,444 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:46,444 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b54c36a3-d47a-4662-9455-773789b7dd26/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 -> ed0ef8676714c03e409913657b72922b069856bc [2019-10-22 11:24:46,468 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:46,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:46,480 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:46,481 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:46,481 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:46,482 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b54c36a3-d47a-4662-9455-773789b7dd26/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem03_label48.c [2019-10-22 11:24:46,529 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b54c36a3-d47a-4662-9455-773789b7dd26/bin/utaipan/data/818793864/879600862b6e4122bd5d21f71797b319/FLAGc3aa64cef [2019-10-22 11:24:47,106 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:47,106 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b54c36a3-d47a-4662-9455-773789b7dd26/sv-benchmarks/c/eca-rers2012/Problem03_label48.c [2019-10-22 11:24:47,120 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b54c36a3-d47a-4662-9455-773789b7dd26/bin/utaipan/data/818793864/879600862b6e4122bd5d21f71797b319/FLAGc3aa64cef [2019-10-22 11:24:47,331 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b54c36a3-d47a-4662-9455-773789b7dd26/bin/utaipan/data/818793864/879600862b6e4122bd5d21f71797b319 [2019-10-22 11:24:47,334 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:47,336 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:47,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:47,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:47,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:47,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:47" (1/1) ... [2019-10-22 11:24:47,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5390f377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:47, skipping insertion in model container [2019-10-22 11:24:47,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:47" (1/1) ... [2019-10-22 11:24:47,351 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:47,447 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:48,212 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:48,220 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:48,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:48,509 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:48,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48 WrapperNode [2019-10-22 11:24:48,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:48,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:48,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:48,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:48,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48" (1/1) ... [2019-10-22 11:24:48,560 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48" (1/1) ... [2019-10-22 11:24:48,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:48,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:48,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:48,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:48,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48" (1/1) ... [2019-10-22 11:24:48,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48" (1/1) ... [2019-10-22 11:24:48,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48" (1/1) ... [2019-10-22 11:24:48,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48" (1/1) ... [2019-10-22 11:24:48,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48" (1/1) ... [2019-10-22 11:24:48,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48" (1/1) ... [2019-10-22 11:24:48,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48" (1/1) ... [2019-10-22 11:24:48,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:48,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:48,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:48,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:48,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b54c36a3-d47a-4662-9455-773789b7dd26/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:48,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:48,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:50,884 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:50,884 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:24:50,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:50 BoogieIcfgContainer [2019-10-22 11:24:50,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:50,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:50,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:50,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:50,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:47" (1/3) ... [2019-10-22 11:24:50,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fae3b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:50, skipping insertion in model container [2019-10-22 11:24:50,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:48" (2/3) ... [2019-10-22 11:24:50,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fae3b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:50, skipping insertion in model container [2019-10-22 11:24:50,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:50" (3/3) ... [2019-10-22 11:24:50,896 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label48.c [2019-10-22 11:24:50,907 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:50,915 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:24:50,927 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:24:50,955 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:50,955 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:24:50,955 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:50,955 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:50,955 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:50,955 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:50,955 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:50,956 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:50,986 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-10-22 11:24:51,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-22 11:24:51,004 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:51,005 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:51,009 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:51,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:51,016 INFO L82 PathProgramCache]: Analyzing trace with hash -819677325, now seen corresponding path program 1 times [2019-10-22 11:24:51,026 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:51,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784526715] [2019-10-22 11:24:51,026 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:51,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:51,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784526715] [2019-10-22 11:24:51,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:51,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:51,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683277327] [2019-10-22 11:24:51,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:51,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:51,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:51,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:51,729 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-10-22 11:24:53,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:53,908 INFO L93 Difference]: Finished difference Result 1075 states and 1929 transitions. [2019-10-22 11:24:53,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:53,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-10-22 11:24:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:53,935 INFO L225 Difference]: With dead ends: 1075 [2019-10-22 11:24:53,936 INFO L226 Difference]: Without dead ends: 677 [2019-10-22 11:24:53,940 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-10-22 11:24:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 451. [2019-10-22 11:24:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-10-22 11:24:54,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 700 transitions. [2019-10-22 11:24:54,015 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 700 transitions. Word has length 183 [2019-10-22 11:24:54,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:54,016 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 700 transitions. [2019-10-22 11:24:54,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 700 transitions. [2019-10-22 11:24:54,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-22 11:24:54,020 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:54,020 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:54,020 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:54,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:54,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1598798580, now seen corresponding path program 1 times [2019-10-22 11:24:54,021 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:54,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033704569] [2019-10-22 11:24:54,021 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:54,021 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:54,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:54,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033704569] [2019-10-22 11:24:54,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:54,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:54,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108497544] [2019-10-22 11:24:54,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:54,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:54,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:54,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:54,137 INFO L87 Difference]: Start difference. First operand 451 states and 700 transitions. Second operand 3 states. [2019-10-22 11:24:55,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:55,101 INFO L93 Difference]: Finished difference Result 1323 states and 2069 transitions. [2019-10-22 11:24:55,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:55,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-10-22 11:24:55,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:55,105 INFO L225 Difference]: With dead ends: 1323 [2019-10-22 11:24:55,105 INFO L226 Difference]: Without dead ends: 874 [2019-10-22 11:24:55,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:55,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-10-22 11:24:55,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 859. [2019-10-22 11:24:55,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-10-22 11:24:55,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1316 transitions. [2019-10-22 11:24:55,144 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1316 transitions. Word has length 191 [2019-10-22 11:24:55,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:55,144 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1316 transitions. [2019-10-22 11:24:55,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:55,144 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1316 transitions. [2019-10-22 11:24:55,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-22 11:24:55,147 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:55,147 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:55,147 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:55,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:55,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1173366829, now seen corresponding path program 1 times [2019-10-22 11:24:55,148 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:55,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772394301] [2019-10-22 11:24:55,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:55,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:55,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:55,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772394301] [2019-10-22 11:24:55,243 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:55,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:55,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386740953] [2019-10-22 11:24:55,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:55,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:55,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:55,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:55,244 INFO L87 Difference]: Start difference. First operand 859 states and 1316 transitions. Second operand 4 states. [2019-10-22 11:24:56,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:56,833 INFO L93 Difference]: Finished difference Result 3364 states and 5170 transitions. [2019-10-22 11:24:56,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:56,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-10-22 11:24:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:56,847 INFO L225 Difference]: With dead ends: 3364 [2019-10-22 11:24:56,848 INFO L226 Difference]: Without dead ends: 2507 [2019-10-22 11:24:56,850 INFO L600 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-10-22 11:24:56,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2019-10-22 11:24:56,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 1682. [2019-10-22 11:24:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2019-10-22 11:24:56,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2434 transitions. [2019-10-22 11:24:56,913 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2434 transitions. Word has length 192 [2019-10-22 11:24:56,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:56,914 INFO L462 AbstractCegarLoop]: Abstraction has 1682 states and 2434 transitions. [2019-10-22 11:24:56,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:56,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2434 transitions. [2019-10-22 11:24:56,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-22 11:24:56,919 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:56,919 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:56,919 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:56,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:56,920 INFO L82 PathProgramCache]: Analyzing trace with hash -73581847, now seen corresponding path program 1 times [2019-10-22 11:24:56,920 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:56,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796916987] [2019-10-22 11:24:56,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:56,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:56,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 11:24:57,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796916987] [2019-10-22 11:24:57,227 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:57,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:57,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628539300] [2019-10-22 11:24:57,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:57,229 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:57,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:57,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:57,230 INFO L87 Difference]: Start difference. First operand 1682 states and 2434 transitions. Second operand 4 states. [2019-10-22 11:24:58,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:58,937 INFO L93 Difference]: Finished difference Result 6614 states and 9588 transitions. [2019-10-22 11:24:58,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:58,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-10-22 11:24:58,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:58,960 INFO L225 Difference]: With dead ends: 6614 [2019-10-22 11:24:58,961 INFO L226 Difference]: Without dead ends: 4934 [2019-10-22 11:24:58,963 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4934 states. [2019-10-22 11:24:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4934 to 4932. [2019-10-22 11:24:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4932 states. [2019-10-22 11:24:59,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4932 states to 4932 states and 6537 transitions. [2019-10-22 11:24:59,069 INFO L78 Accepts]: Start accepts. Automaton has 4932 states and 6537 transitions. Word has length 198 [2019-10-22 11:24:59,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:59,070 INFO L462 AbstractCegarLoop]: Abstraction has 4932 states and 6537 transitions. [2019-10-22 11:24:59,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:59,070 INFO L276 IsEmpty]: Start isEmpty. Operand 4932 states and 6537 transitions. [2019-10-22 11:24:59,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-22 11:24:59,079 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:59,079 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:59,079 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:59,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:59,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1185291772, now seen corresponding path program 1 times [2019-10-22 11:24:59,080 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:59,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330261818] [2019-10-22 11:24:59,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:59,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:59,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:59,202 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:59,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330261818] [2019-10-22 11:24:59,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:59,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:59,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574756308] [2019-10-22 11:24:59,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:59,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:59,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:59,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:59,205 INFO L87 Difference]: Start difference. First operand 4932 states and 6537 transitions. Second operand 3 states. [2019-10-22 11:25:00,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:00,199 INFO L93 Difference]: Finished difference Result 11905 states and 15682 transitions. [2019-10-22 11:25:00,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:00,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-10-22 11:25:00,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:00,224 INFO L225 Difference]: With dead ends: 11905 [2019-10-22 11:25:00,224 INFO L226 Difference]: Without dead ends: 6975 [2019-10-22 11:25:00,230 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:00,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6975 states. [2019-10-22 11:25:00,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6975 to 6974. [2019-10-22 11:25:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6974 states. [2019-10-22 11:25:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6974 states to 6974 states and 8983 transitions. [2019-10-22 11:25:00,378 INFO L78 Accepts]: Start accepts. Automaton has 6974 states and 8983 transitions. Word has length 224 [2019-10-22 11:25:00,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:00,378 INFO L462 AbstractCegarLoop]: Abstraction has 6974 states and 8983 transitions. [2019-10-22 11:25:00,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 6974 states and 8983 transitions. [2019-10-22 11:25:00,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-22 11:25:00,392 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:00,392 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:00,393 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:00,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:00,393 INFO L82 PathProgramCache]: Analyzing trace with hash -321194833, now seen corresponding path program 1 times [2019-10-22 11:25:00,393 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:00,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017624914] [2019-10-22 11:25:00,394 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:00,394 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:00,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:00,721 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017624914] [2019-10-22 11:25:00,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409669025] [2019-10-22 11:25:00,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b54c36a3-d47a-4662-9455-773789b7dd26/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:00,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:25:00,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:25:00,962 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 11:25:00,962 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:25:01,029 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 11:25:01,033 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:25:01,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-10-22 11:25:01,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244270423] [2019-10-22 11:25:01,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:01,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:01,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:01,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:01,036 INFO L87 Difference]: Start difference. First operand 6974 states and 8983 transitions. Second operand 3 states. [2019-10-22 11:25:01,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:01,955 INFO L93 Difference]: Finished difference Result 19432 states and 24902 transitions. [2019-10-22 11:25:01,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:01,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-10-22 11:25:01,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:02,014 INFO L225 Difference]: With dead ends: 19432 [2019-10-22 11:25:02,014 INFO L226 Difference]: Without dead ends: 12460 [2019-10-22 11:25:02,029 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:02,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12460 states. [2019-10-22 11:25:02,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12460 to 12459. [2019-10-22 11:25:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12459 states. [2019-10-22 11:25:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12459 states to 12459 states and 15314 transitions. [2019-10-22 11:25:02,304 INFO L78 Accepts]: Start accepts. Automaton has 12459 states and 15314 transitions. Word has length 231 [2019-10-22 11:25:02,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:02,305 INFO L462 AbstractCegarLoop]: Abstraction has 12459 states and 15314 transitions. [2019-10-22 11:25:02,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 12459 states and 15314 transitions. [2019-10-22 11:25:02,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-22 11:25:02,331 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:02,332 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:02,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:02,533 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:02,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:02,534 INFO L82 PathProgramCache]: Analyzing trace with hash 768090626, now seen corresponding path program 1 times [2019-10-22 11:25:02,535 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:02,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879975042] [2019-10-22 11:25:02,535 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:02,535 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:02,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:02,904 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:02,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879975042] [2019-10-22 11:25:02,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:02,907 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:02,907 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273712105] [2019-10-22 11:25:02,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:02,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:02,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:02,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:02,908 INFO L87 Difference]: Start difference. First operand 12459 states and 15314 transitions. Second operand 4 states. [2019-10-22 11:25:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:04,290 INFO L93 Difference]: Finished difference Result 30647 states and 37340 transitions. [2019-10-22 11:25:04,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:04,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-10-22 11:25:04,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:04,332 INFO L225 Difference]: With dead ends: 30647 [2019-10-22 11:25:04,332 INFO L226 Difference]: Without dead ends: 18190 [2019-10-22 11:25:04,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:04,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18190 states. [2019-10-22 11:25:04,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18190 to 14503. [2019-10-22 11:25:04,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14503 states. [2019-10-22 11:25:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14503 states to 14503 states and 17503 transitions. [2019-10-22 11:25:04,611 INFO L78 Accepts]: Start accepts. Automaton has 14503 states and 17503 transitions. Word has length 246 [2019-10-22 11:25:04,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:04,611 INFO L462 AbstractCegarLoop]: Abstraction has 14503 states and 17503 transitions. [2019-10-22 11:25:04,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:04,612 INFO L276 IsEmpty]: Start isEmpty. Operand 14503 states and 17503 transitions. [2019-10-22 11:25:04,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-22 11:25:04,637 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:04,638 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:04,638 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:04,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:04,639 INFO L82 PathProgramCache]: Analyzing trace with hash 2030031962, now seen corresponding path program 1 times [2019-10-22 11:25:04,639 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:04,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054346186] [2019-10-22 11:25:04,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:04,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:04,758 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-22 11:25:04,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054346186] [2019-10-22 11:25:04,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:04,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:04,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715146717] [2019-10-22 11:25:04,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:04,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:04,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:04,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:04,761 INFO L87 Difference]: Start difference. First operand 14503 states and 17503 transitions. Second operand 4 states. [2019-10-22 11:25:05,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:05,817 INFO L93 Difference]: Finished difference Result 29005 states and 35006 transitions. [2019-10-22 11:25:05,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:05,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 248 [2019-10-22 11:25:05,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:05,842 INFO L225 Difference]: With dead ends: 29005 [2019-10-22 11:25:05,843 INFO L226 Difference]: Without dead ends: 14504 [2019-10-22 11:25:05,855 INFO L600 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-10-22 11:25:05,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14504 states. [2019-10-22 11:25:06,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14504 to 14503. [2019-10-22 11:25:06,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14503 states. [2019-10-22 11:25:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14503 states to 14503 states and 16848 transitions. [2019-10-22 11:25:06,066 INFO L78 Accepts]: Start accepts. Automaton has 14503 states and 16848 transitions. Word has length 248 [2019-10-22 11:25:06,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:06,066 INFO L462 AbstractCegarLoop]: Abstraction has 14503 states and 16848 transitions. [2019-10-22 11:25:06,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:06,067 INFO L276 IsEmpty]: Start isEmpty. Operand 14503 states and 16848 transitions. [2019-10-22 11:25:06,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-10-22 11:25:06,090 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:06,090 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:06,090 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:06,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:06,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1718686317, now seen corresponding path program 1 times [2019-10-22 11:25:06,091 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:06,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646022857] [2019-10-22 11:25:06,091 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:06,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:06,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:06,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646022857] [2019-10-22 11:25:06,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100404273] [2019-10-22 11:25:06,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b54c36a3-d47a-4662-9455-773789b7dd26/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:06,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:25:06,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:25:06,498 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 11:25:06,499 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:25:06,560 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 11:25:06,560 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:25:06,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-22 11:25:06,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52125681] [2019-10-22 11:25:06,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:06,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:06,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:06,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:25:06,562 INFO L87 Difference]: Start difference. First operand 14503 states and 16848 transitions. Second operand 3 states. [2019-10-22 11:25:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:07,569 INFO L93 Difference]: Finished difference Result 37557 states and 43797 transitions. [2019-10-22 11:25:07,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:07,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-10-22 11:25:07,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:07,603 INFO L225 Difference]: With dead ends: 37557 [2019-10-22 11:25:07,603 INFO L226 Difference]: Without dead ends: 23056 [2019-10-22 11:25:07,621 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:25:07,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23056 states. [2019-10-22 11:25:08,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23056 to 23029. [2019-10-22 11:25:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23029 states. [2019-10-22 11:25:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23029 states to 23029 states and 26631 transitions. [2019-10-22 11:25:08,136 INFO L78 Accepts]: Start accepts. Automaton has 23029 states and 26631 transitions. Word has length 253 [2019-10-22 11:25:08,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:08,137 INFO L462 AbstractCegarLoop]: Abstraction has 23029 states and 26631 transitions. [2019-10-22 11:25:08,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:08,137 INFO L276 IsEmpty]: Start isEmpty. Operand 23029 states and 26631 transitions. [2019-10-22 11:25:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-22 11:25:08,161 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:08,162 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:08,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:08,362 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:08,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:08,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1626982926, now seen corresponding path program 1 times [2019-10-22 11:25:08,363 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:08,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248202935] [2019-10-22 11:25:08,363 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:08,363 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:08,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:08,521 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 86 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-22 11:25:08,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248202935] [2019-10-22 11:25:08,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990566296] [2019-10-22 11:25:08,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b54c36a3-d47a-4662-9455-773789b7dd26/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:08,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:25:08,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:25:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 11:25:08,674 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:25:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 11:25:08,708 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:25:08,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-10-22 11:25:08,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343087700] [2019-10-22 11:25:08,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:08,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:08,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:08,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:08,710 INFO L87 Difference]: Start difference. First operand 23029 states and 26631 transitions. Second operand 3 states. [2019-10-22 11:25:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:09,438 INFO L93 Difference]: Finished difference Result 46059 states and 53264 transitions. [2019-10-22 11:25:09,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:09,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-10-22 11:25:09,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:09,462 INFO L225 Difference]: With dead ends: 46059 [2019-10-22 11:25:09,462 INFO L226 Difference]: Without dead ends: 23032 [2019-10-22 11:25:09,476 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23032 states. [2019-10-22 11:25:09,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23032 to 20999. [2019-10-22 11:25:09,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20999 states. [2019-10-22 11:25:09,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20999 states to 20999 states and 23688 transitions. [2019-10-22 11:25:09,942 INFO L78 Accepts]: Start accepts. Automaton has 20999 states and 23688 transitions. Word has length 261 [2019-10-22 11:25:09,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:09,943 INFO L462 AbstractCegarLoop]: Abstraction has 20999 states and 23688 transitions. [2019-10-22 11:25:09,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:09,943 INFO L276 IsEmpty]: Start isEmpty. Operand 20999 states and 23688 transitions. [2019-10-22 11:25:09,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-22 11:25:09,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:09,963 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:10,163 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:10,164 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:10,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:10,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2109683622, now seen corresponding path program 1 times [2019-10-22 11:25:10,164 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:10,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577785699] [2019-10-22 11:25:10,165 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:10,165 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:10,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:10,271 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-22 11:25:10,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577785699] [2019-10-22 11:25:10,271 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:10,271 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:10,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411398177] [2019-10-22 11:25:10,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:10,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:10,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:10,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:10,272 INFO L87 Difference]: Start difference. First operand 20999 states and 23688 transitions. Second operand 3 states. [2019-10-22 11:25:10,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:10,771 INFO L93 Difference]: Finished difference Result 38917 states and 43741 transitions. [2019-10-22 11:25:10,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:10,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-10-22 11:25:10,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:10,784 INFO L225 Difference]: With dead ends: 38917 [2019-10-22 11:25:10,784 INFO L226 Difference]: Without dead ends: 17920 [2019-10-22 11:25:10,792 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:10,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17920 states. [2019-10-22 11:25:10,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17920 to 16702. [2019-10-22 11:25:10,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16702 states. [2019-10-22 11:25:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16702 states to 16702 states and 18608 transitions. [2019-10-22 11:25:10,979 INFO L78 Accepts]: Start accepts. Automaton has 16702 states and 18608 transitions. Word has length 274 [2019-10-22 11:25:10,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:10,979 INFO L462 AbstractCegarLoop]: Abstraction has 16702 states and 18608 transitions. [2019-10-22 11:25:10,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 16702 states and 18608 transitions. [2019-10-22 11:25:10,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-10-22 11:25:10,990 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:10,991 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:10,991 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:10,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:10,991 INFO L82 PathProgramCache]: Analyzing trace with hash -5984517, now seen corresponding path program 1 times [2019-10-22 11:25:10,991 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:10,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479800896] [2019-10-22 11:25:10,992 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:10,992 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:10,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 141 proven. 3 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-22 11:25:11,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479800896] [2019-10-22 11:25:11,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136874587] [2019-10-22 11:25:11,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b54c36a3-d47a-4662-9455-773789b7dd26/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:11,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:25:11,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:25:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-22 11:25:11,451 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:25:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-22 11:25:11,594 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:25:11,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-22 11:25:11,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279179877] [2019-10-22 11:25:11,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:11,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:11,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:11,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:25:11,600 INFO L87 Difference]: Start difference. First operand 16702 states and 18608 transitions. Second operand 3 states. [2019-10-22 11:25:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:12,806 INFO L93 Difference]: Finished difference Result 34219 states and 38120 transitions. [2019-10-22 11:25:12,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:12,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 363 [2019-10-22 11:25:12,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:12,808 INFO L225 Difference]: With dead ends: 34219 [2019-10-22 11:25:12,808 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:25:12,819 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 723 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:25:12,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:25:12,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:25:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:25:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:25:12,820 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 363 [2019-10-22 11:25:12,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:12,821 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:25:12,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:25:12,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:25:13,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:13,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:25:13,224 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 127 [2019-10-22 11:25:13,391 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 127 [2019-10-22 11:25:14,002 WARN L191 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 41 [2019-10-22 11:25:14,607 WARN L191 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 41 [2019-10-22 11:25:14,608 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-10-22 11:25:14,609 INFO L443 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-10-22 11:25:14,609 INFO L443 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,609 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,609 INFO L443 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,609 INFO L443 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,609 INFO L443 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,609 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,609 INFO L443 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,609 INFO L443 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-10-22 11:25:14,609 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,609 INFO L443 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-10-22 11:25:14,609 INFO L443 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-10-22 11:25:14,610 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,610 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,610 INFO L443 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,610 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,610 INFO L443 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-10-22 11:25:14,610 INFO L443 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-10-22 11:25:14,610 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,610 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,611 INFO L443 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,611 INFO L443 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,611 INFO L443 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,611 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,611 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,611 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,611 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,611 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,611 INFO L443 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-10-22 11:25:14,611 INFO L443 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-10-22 11:25:14,611 INFO L443 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-10-22 11:25:14,611 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,612 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,612 INFO L443 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,612 INFO L443 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,612 INFO L443 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,612 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,612 INFO L443 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-10-22 11:25:14,613 INFO L443 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-10-22 11:25:14,613 INFO L443 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-10-22 11:25:14,613 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,613 INFO L443 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,613 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,614 INFO L443 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,614 INFO L443 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,614 INFO L443 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,614 INFO L443 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-10-22 11:25:14,614 INFO L443 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-10-22 11:25:14,614 INFO L443 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-10-22 11:25:14,614 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,614 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,614 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,614 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-10-22 11:25:14,614 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,614 INFO L443 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-10-22 11:25:14,614 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,615 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,615 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-10-22 11:25:14,615 INFO L443 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-10-22 11:25:14,615 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,615 INFO L443 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,615 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,615 INFO L443 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,615 INFO L443 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,615 INFO L443 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,615 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,615 INFO L443 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-10-22 11:25:14,615 INFO L443 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-10-22 11:25:14,615 INFO L443 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-10-22 11:25:14,616 INFO L443 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-10-22 11:25:14,616 INFO L443 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-10-22 11:25:14,616 INFO L443 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,616 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,616 INFO L443 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,616 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,616 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,616 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,616 INFO L443 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,616 INFO L443 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,616 INFO L443 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,616 INFO L443 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,616 INFO L443 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-10-22 11:25:14,617 INFO L443 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-10-22 11:25:14,617 INFO L443 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-10-22 11:25:14,617 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,617 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,617 INFO L443 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,617 INFO L443 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,617 INFO L443 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,617 INFO L443 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,617 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,617 INFO L443 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,617 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,617 INFO L443 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-10-22 11:25:14,617 INFO L443 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-10-22 11:25:14,618 INFO L443 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-10-22 11:25:14,618 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-10-22 11:25:14,618 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-10-22 11:25:14,618 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,618 INFO L443 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,618 INFO L443 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,618 INFO L443 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,618 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,619 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:25:14,619 INFO L443 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,619 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,619 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,620 INFO L443 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-10-22 11:25:14,620 INFO L443 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-10-22 11:25:14,620 INFO L443 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-10-22 11:25:14,620 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,620 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,620 INFO L443 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,620 INFO L443 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-10-22 11:25:14,621 INFO L443 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-10-22 11:25:14,621 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,621 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,621 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,621 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-10-22 11:25:14,621 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,621 INFO L443 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-10-22 11:25:14,621 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1584) no Hoare annotation was computed. [2019-10-22 11:25:14,621 INFO L443 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,621 INFO L443 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-10-22 11:25:14,621 INFO L443 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,621 INFO L443 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,621 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-10-22 11:25:14,622 INFO L443 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-10-22 11:25:14,622 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-10-22 11:25:14,622 INFO L443 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-10-22 11:25:14,622 INFO L443 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-10-22 11:25:14,622 INFO L443 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-10-22 11:25:14,622 INFO L443 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-10-22 11:25:14,622 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,622 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,622 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,623 INFO L439 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse11 (not (= ~a12~0 1))) (.cse1 (= 1 ~a6~0))) (let ((.cse2 (= ~a5~0 1)) (.cse7 (and .cse11 (not .cse1))) (.cse0 (= ~a27~0 1)) (.cse4 (<= ~a11~0 0)) (.cse9 (not (= 1 ~a3~0))) (.cse10 (= 0 ~a3~0)) (.cse5 (= ~a26~0 1)) (.cse6 (= 1 ~a5~0)) (.cse3 (= ~a11~0 1)) (.cse8 (<= ~a27~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 .cse5) (and .cse6 .cse3 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse5) (and .cse6 .cse4 .cse10 .cse8) (and .cse6 .cse4 .cse5 .cse8 .cse9) (and .cse6 (and .cse11 .cse0) .cse3) (and .cse0 .cse4 .cse2 .cse9) (and .cse6 .cse4 .cse7 .cse8) (and .cse6 .cse3 .cse5 .cse8) (and .cse6 .cse1 .cse4 .cse8) (and .cse6 .cse0 .cse4 .cse11) (and .cse11 .cse6 .cse1 .cse4 .cse9) (and .cse11 .cse6 .cse1 .cse10 .cse3 .cse5) (and .cse6 .cse1 .cse3 .cse8)))) [2019-10-22 11:25:14,624 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,624 INFO L443 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,624 INFO L443 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,624 INFO L443 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-10-22 11:25:14,624 INFO L443 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-10-22 11:25:14,624 INFO L443 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,624 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,625 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:25:14,625 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,625 INFO L446 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-10-22 11:25:14,625 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,625 INFO L443 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,625 INFO L443 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,625 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,625 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,625 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,625 INFO L443 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-10-22 11:25:14,625 INFO L443 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-10-22 11:25:14,625 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,625 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,626 INFO L443 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,626 INFO L443 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,626 INFO L443 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,626 INFO L443 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,626 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,626 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,626 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,626 INFO L443 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-10-22 11:25:14,626 INFO L443 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-10-22 11:25:14,626 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,626 INFO L443 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,626 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-10-22 11:25:14,626 INFO L443 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-10-22 11:25:14,626 INFO L443 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,627 INFO L439 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse11 (not (= ~a12~0 1))) (.cse1 (= 1 ~a6~0))) (let ((.cse2 (= ~a5~0 1)) (.cse7 (and .cse11 (not .cse1))) (.cse0 (= ~a27~0 1)) (.cse4 (<= ~a11~0 0)) (.cse9 (not (= 1 ~a3~0))) (.cse10 (= 0 ~a3~0)) (.cse5 (= ~a26~0 1)) (.cse6 (= 1 ~a5~0)) (.cse3 (= ~a11~0 1)) (.cse8 (<= ~a27~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 .cse5) (and .cse6 .cse3 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse5) (and .cse6 .cse4 .cse10 .cse8) (and .cse6 .cse4 .cse5 .cse8 .cse9) (and .cse6 (and .cse11 .cse0) .cse3) (and .cse0 .cse4 .cse2 .cse9) (and .cse6 .cse4 .cse7 .cse8) (and .cse6 .cse3 .cse5 .cse8) (and .cse6 .cse1 .cse4 .cse8) (and .cse6 .cse0 .cse4 .cse11) (and .cse11 .cse6 .cse1 .cse4 .cse9) (and .cse11 .cse6 .cse1 .cse10 .cse3 .cse5) (and .cse6 .cse1 .cse3 .cse8)))) [2019-10-22 11:25:14,627 INFO L443 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,627 INFO L443 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,627 INFO L443 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,627 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,627 INFO L443 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-10-22 11:25:14,627 INFO L443 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-10-22 11:25:14,627 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,627 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,627 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,628 INFO L443 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,628 INFO L443 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,628 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,628 INFO L443 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,628 INFO L443 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,628 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-10-22 11:25:14,628 INFO L443 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-10-22 11:25:14,628 INFO L443 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-10-22 11:25:14,628 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,628 INFO L443 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-10-22 11:25:14,628 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,628 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,628 INFO L443 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-10-22 11:25:14,628 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,629 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,629 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,629 INFO L443 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,629 INFO L443 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,629 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-10-22 11:25:14,629 INFO L443 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,629 INFO L443 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-10-22 11:25:14,629 INFO L443 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-10-22 11:25:14,629 INFO L443 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-10-22 11:25:14,629 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,629 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,629 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,629 INFO L443 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,629 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,630 INFO L443 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,630 INFO L443 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,630 INFO L443 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,630 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-10-22 11:25:14,630 INFO L443 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-10-22 11:25:14,630 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,630 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,630 INFO L443 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-10-22 11:25:14,630 INFO L443 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-10-22 11:25:14,631 INFO L443 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-10-22 11:25:14,632 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,632 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,632 INFO L443 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,632 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,632 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,632 INFO L443 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,632 INFO L443 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,632 INFO L443 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,632 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,632 INFO L443 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,632 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,632 INFO L443 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-10-22 11:25:14,632 INFO L443 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-10-22 11:25:14,632 INFO L443 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-10-22 11:25:14,633 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:25:14,633 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,633 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,633 INFO L443 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,633 INFO L443 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,633 INFO L443 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,633 INFO L443 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,633 INFO L443 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,633 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-10-22 11:25:14,633 INFO L443 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-10-22 11:25:14,633 INFO L443 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,634 INFO L443 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-10-22 11:25:14,634 INFO L443 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-10-22 11:25:14,635 INFO L443 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-10-22 11:25:14,635 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,635 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,635 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,635 INFO L443 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,635 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,636 INFO L443 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-10-22 11:25:14,636 INFO L443 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-10-22 11:25:14,636 INFO L443 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,636 INFO L443 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,636 INFO L443 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,636 INFO L443 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-10-22 11:25:14,636 INFO L443 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-10-22 11:25:14,636 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,636 INFO L443 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-10-22 11:25:14,636 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,636 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,636 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,636 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,636 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,637 INFO L443 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,637 INFO L443 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,637 INFO L443 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,637 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,637 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,637 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:25:14,637 INFO L443 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-10-22 11:25:14,637 INFO L443 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-10-22 11:25:14,637 INFO L443 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-10-22 11:25:14,637 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,637 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-10-22 11:25:14,637 INFO L443 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-10-22 11:25:14,637 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,637 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,638 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,638 INFO L443 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,638 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,638 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,638 INFO L443 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,638 INFO L443 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,638 INFO L443 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,638 INFO L443 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-10-22 11:25:14,640 INFO L443 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-10-22 11:25:14,640 INFO L443 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-10-22 11:25:14,640 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,641 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,641 INFO L443 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,641 INFO L443 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,641 INFO L443 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-10-22 11:25:14,641 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,641 INFO L443 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-10-22 11:25:14,641 INFO L443 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-10-22 11:25:14,641 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,641 INFO L443 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-10-22 11:25:14,641 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-10-22 11:25:14,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:25:14 BoogieIcfgContainer [2019-10-22 11:25:14,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:25:14,676 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:25:14,676 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:25:14,677 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:25:14,677 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:50" (3/4) ... [2019-10-22 11:25:14,680 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:25:14,712 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 11:25:14,717 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:25:14,938 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b54c36a3-d47a-4662-9455-773789b7dd26/bin/utaipan/witness.graphml [2019-10-22 11:25:14,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:25:14,939 INFO L168 Benchmark]: Toolchain (without parser) took 27604.27 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 942.3 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 847.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:14,940 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:25:14,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1173.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 942.3 MB in the beginning and 1.1 GB in the end (delta: -149.6 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:14,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:14,940 INFO L168 Benchmark]: Boogie Preprocessor took 119.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:14,941 INFO L168 Benchmark]: RCFGBuilder took 2126.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.9 MB). Peak memory consumption was 189.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:14,941 INFO L168 Benchmark]: TraceAbstraction took 23789.28 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 866.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -125.3 MB). Peak memory consumption was 740.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:14,941 INFO L168 Benchmark]: Witness Printer took 261.76 ms. Allocated memory is still 2.1 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:14,943 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1173.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 942.3 MB in the beginning and 1.1 GB in the end (delta: -149.6 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 129.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 119.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2126.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 16.9 MB). Peak memory consumption was 189.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23789.28 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 866.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -125.3 MB). Peak memory consumption was 740.9 MB. Max. memory is 11.5 GB. * Witness Printer took 261.76 ms. Allocated memory is still 2.1 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1584]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((a27 == 1 && 1 == a6) && a5 == 1) && a11 == 1) || (((a27 == 1 && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((1 == a5 && a11 == 1) && !(a12 == 1) && !(1 == a6)) && a27 <= 0) && !(1 == a3))) || (((a27 == 1 && a5 == 1) && a11 == 1) && a26 == 1)) || (((1 == a5 && a11 <= 0) && 0 == a3) && a27 <= 0)) || ((((1 == a5 && a11 <= 0) && a26 == 1) && a27 <= 0) && !(1 == a3))) || ((1 == a5 && !(a12 == 1) && a27 == 1) && a11 == 1)) || (((a27 == 1 && a11 <= 0) && a5 == 1) && !(1 == a3))) || (((1 == a5 && a11 <= 0) && !(a12 == 1) && !(1 == a6)) && a27 <= 0)) || (((1 == a5 && a11 == 1) && a26 == 1) && a27 <= 0)) || (((1 == a5 && 1 == a6) && a11 <= 0) && a27 <= 0)) || (((1 == a5 && a27 == 1) && a11 <= 0) && !(a12 == 1))) || ((((!(a12 == 1) && 1 == a5) && 1 == a6) && a11 <= 0) && !(1 == a3))) || (((((!(a12 == 1) && 1 == a5) && 1 == a6) && 0 == a3) && a11 == 1) && a26 == 1)) || (((1 == a5 && 1 == a6) && a11 == 1) && a27 <= 0) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((a27 == 1 && 1 == a6) && a5 == 1) && a11 == 1) || (((a27 == 1 && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((1 == a5 && a11 == 1) && !(a12 == 1) && !(1 == a6)) && a27 <= 0) && !(1 == a3))) || (((a27 == 1 && a5 == 1) && a11 == 1) && a26 == 1)) || (((1 == a5 && a11 <= 0) && 0 == a3) && a27 <= 0)) || ((((1 == a5 && a11 <= 0) && a26 == 1) && a27 <= 0) && !(1 == a3))) || ((1 == a5 && !(a12 == 1) && a27 == 1) && a11 == 1)) || (((a27 == 1 && a11 <= 0) && a5 == 1) && !(1 == a3))) || (((1 == a5 && a11 <= 0) && !(a12 == 1) && !(1 == a6)) && a27 <= 0)) || (((1 == a5 && a11 == 1) && a26 == 1) && a27 <= 0)) || (((1 == a5 && 1 == a6) && a11 <= 0) && a27 <= 0)) || (((1 == a5 && a27 == 1) && a11 <= 0) && !(a12 == 1))) || ((((!(a12 == 1) && 1 == a5) && 1 == a6) && a11 <= 0) && !(1 == a3))) || (((((!(a12 == 1) && 1 == a5) && 1 == a6) && 0 == a3) && a11 == 1) && a26 == 1)) || (((1 == a5 && 1 == a6) && a11 == 1) && a27 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 23.6s, OverallIterations: 12, TraceHistogramMax: 5, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, HoareTripleCheckerStatistics: 2551 SDtfs, 3417 SDslu, 376 SDs, 0 SdLazy, 8804 SolverSat, 1783 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2252 GetRequests, 2217 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23029occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 8036 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 178 NumberOfFragments, 465 HoareAnnotationTreeSize, 3 FomulaSimplifications, 4450 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3878 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3972 NumberOfCodeBlocks, 3972 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 5060 ConstructedInterpolants, 0 QuantifiedInterpolants, 2877693 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1906 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 1901/1913 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...