./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label48.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_05025f63-f6bc-4602-8d66-b9e487b97b70/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_05025f63-f6bc-4602-8d66-b9e487b97b70/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_05025f63-f6bc-4602-8d66-b9e487b97b70/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_05025f63-f6bc-4602-8d66-b9e487b97b70/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label48.c -s /tmp/vcloud-vcloud-master/worker/working_dir_05025f63-f6bc-4602-8d66-b9e487b97b70/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_05025f63-f6bc-4602-8d66-b9e487b97b70/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0efda15f8357629016064e69e444205aff537305 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:24:23,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:23,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:23,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:23,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:23,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:23,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:23,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:23,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:23,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:23,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:23,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:23,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:23,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:23,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:23,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:23,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:23,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:23,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:23,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:23,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:23,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:23,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:23,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:23,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:23,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:23,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:23,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:23,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:23,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:23,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:23,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:23,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:23,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:23,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:23,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:23,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:23,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:23,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:23,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:23,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:23,444 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_05025f63-f6bc-4602-8d66-b9e487b97b70/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:24:23,457 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:23,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:23,459 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:23,459 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:23,459 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:23,459 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:23,460 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:24:23,460 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:23,460 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:23,460 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:24:23,461 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:24:23,461 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:23,462 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:23,462 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:23,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:24:23,462 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:23,463 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:23,463 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:24:23,463 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:23,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:24:23,464 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:23,464 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:24:23,464 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:24:23,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:23,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:23,465 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:23,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:23,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:23,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:23,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:23,466 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:24:23,467 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:24:23,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:24:23,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:24:23,468 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:23,468 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_05025f63-f6bc-4602-8d66-b9e487b97b70/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0efda15f8357629016064e69e444205aff537305 [2019-10-22 11:24:23,497 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:23,509 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:23,513 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:23,514 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:23,514 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:23,515 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_05025f63-f6bc-4602-8d66-b9e487b97b70/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label48.c [2019-10-22 11:24:23,571 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05025f63-f6bc-4602-8d66-b9e487b97b70/bin/utaipan/data/5ba3f6832/0d829c4b1b644a8bb0d727ad04b96d49/FLAGbdf48995f [2019-10-22 11:24:24,033 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:24,034 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_05025f63-f6bc-4602-8d66-b9e487b97b70/sv-benchmarks/c/eca-rers2012/Problem01_label48.c [2019-10-22 11:24:24,046 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_05025f63-f6bc-4602-8d66-b9e487b97b70/bin/utaipan/data/5ba3f6832/0d829c4b1b644a8bb0d727ad04b96d49/FLAGbdf48995f [2019-10-22 11:24:24,333 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_05025f63-f6bc-4602-8d66-b9e487b97b70/bin/utaipan/data/5ba3f6832/0d829c4b1b644a8bb0d727ad04b96d49 [2019-10-22 11:24:24,336 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:24,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:24,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:24,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:24,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:24,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:24" (1/1) ... [2019-10-22 11:24:24,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1edf5c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:24, skipping insertion in model container [2019-10-22 11:24:24,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:24" (1/1) ... [2019-10-22 11:24:24,355 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:24,423 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:24,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:24,862 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:25,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:25,047 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:25,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:25 WrapperNode [2019-10-22 11:24:25,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:25,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:25,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:25,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:25,057 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:25" (1/1) ... [2019-10-22 11:24:25,076 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:25" (1/1) ... [2019-10-22 11:24:25,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:25,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:25,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:25,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:25,143 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:25" (1/1) ... [2019-10-22 11:24:25,144 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:25" (1/1) ... [2019-10-22 11:24:25,149 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:25" (1/1) ... [2019-10-22 11:24:25,149 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:25" (1/1) ... [2019-10-22 11:24:25,174 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:25" (1/1) ... [2019-10-22 11:24:25,190 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:25" (1/1) ... [2019-10-22 11:24:25,196 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:25" (1/1) ... [2019-10-22 11:24:25,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:25,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:25,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:25,206 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:25,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05025f63-f6bc-4602-8d66-b9e487b97b70/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:25,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:25,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:26,607 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:26,607 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:24:26,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:26 BoogieIcfgContainer [2019-10-22 11:24:26,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:26,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:26,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:26,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:26,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:24" (1/3) ... [2019-10-22 11:24:26,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7253de8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:26, skipping insertion in model container [2019-10-22 11:24:26,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:25" (2/3) ... [2019-10-22 11:24:26,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7253de8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:26, skipping insertion in model container [2019-10-22 11:24:26,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:26" (3/3) ... [2019-10-22 11:24:26,619 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label48.c [2019-10-22 11:24:26,632 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:26,641 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:24:26,656 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:24:26,692 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:26,695 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:24:26,695 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:26,695 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:26,695 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:26,695 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:26,695 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:26,696 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:26,719 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-10-22 11:24:26,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-22 11:24:26,734 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:26,735 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] [2019-10-22 11:24:26,737 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:26,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:26,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1763883850, now seen corresponding path program 1 times [2019-10-22 11:24:26,755 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:26,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149593178] [2019-10-22 11:24:26,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:26,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:26,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:27,286 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:27,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149593178] [2019-10-22 11:24:27,288 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:27,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:27,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829565774] [2019-10-22 11:24:27,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:27,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:27,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:27,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:27,317 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-10-22 11:24:28,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:28,551 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-10-22 11:24:28,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:28,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-10-22 11:24:28,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:28,566 INFO L225 Difference]: With dead ends: 662 [2019-10-22 11:24:28,566 INFO L226 Difference]: Without dead ends: 397 [2019-10-22 11:24:28,569 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:28,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-10-22 11:24:28,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-10-22 11:24:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-10-22 11:24:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 577 transitions. [2019-10-22 11:24:28,625 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 577 transitions. Word has length 121 [2019-10-22 11:24:28,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:28,626 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 577 transitions. [2019-10-22 11:24:28,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:28,626 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 577 transitions. [2019-10-22 11:24:28,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-22 11:24:28,630 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:28,630 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,631 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:28,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:28,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1818986610, now seen corresponding path program 1 times [2019-10-22 11:24:28,631 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:28,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909552562] [2019-10-22 11:24:28,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:28,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:28,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:28,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909552562] [2019-10-22 11:24:28,698 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:28,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:28,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91329472] [2019-10-22 11:24:28,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:28,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:28,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:28,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:28,708 INFO L87 Difference]: Start difference. First operand 397 states and 577 transitions. Second operand 3 states. [2019-10-22 11:24:29,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:29,221 INFO L93 Difference]: Finished difference Result 1185 states and 1726 transitions. [2019-10-22 11:24:29,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:29,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-10-22 11:24:29,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:29,229 INFO L225 Difference]: With dead ends: 1185 [2019-10-22 11:24:29,233 INFO L226 Difference]: Without dead ends: 790 [2019-10-22 11:24:29,236 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:29,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-10-22 11:24:29,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659. [2019-10-22 11:24:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-10-22 11:24:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 888 transitions. [2019-10-22 11:24:29,299 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 888 transitions. Word has length 134 [2019-10-22 11:24:29,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:29,300 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 888 transitions. [2019-10-22 11:24:29,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:29,300 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 888 transitions. [2019-10-22 11:24:29,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-22 11:24:29,306 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:29,306 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,306 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:29,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:29,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1407656640, now seen corresponding path program 1 times [2019-10-22 11:24:29,307 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:29,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661038386] [2019-10-22 11:24:29,307 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:29,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:29,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:29,426 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 11:24:29,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661038386] [2019-10-22 11:24:29,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:29,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:29,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568017992] [2019-10-22 11:24:29,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:29,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:29,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:29,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:29,428 INFO L87 Difference]: Start difference. First operand 659 states and 888 transitions. Second operand 4 states. [2019-10-22 11:24:30,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:30,246 INFO L93 Difference]: Finished difference Result 2233 states and 3034 transitions. [2019-10-22 11:24:30,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:30,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-10-22 11:24:30,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:30,254 INFO L225 Difference]: With dead ends: 2233 [2019-10-22 11:24:30,254 INFO L226 Difference]: Without dead ends: 1576 [2019-10-22 11:24:30,256 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:30,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-10-22 11:24:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2019-10-22 11:24:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-10-22 11:24:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1879 transitions. [2019-10-22 11:24:30,303 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1879 transitions. Word has length 143 [2019-10-22 11:24:30,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:30,305 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1879 transitions. [2019-10-22 11:24:30,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1879 transitions. [2019-10-22 11:24:30,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-22 11:24:30,320 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:30,320 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,320 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:30,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:30,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1463287631, now seen corresponding path program 1 times [2019-10-22 11:24:30,321 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:30,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202995177] [2019-10-22 11:24:30,321 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:30,321 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:30,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 11:24:30,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202995177] [2019-10-22 11:24:30,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:30,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:30,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006924158] [2019-10-22 11:24:30,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:30,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:30,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:30,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:30,452 INFO L87 Difference]: Start difference. First operand 1445 states and 1879 transitions. Second operand 4 states. [2019-10-22 11:24:31,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:31,042 INFO L93 Difference]: Finished difference Result 3027 states and 3913 transitions. [2019-10-22 11:24:31,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:31,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-10-22 11:24:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:31,049 INFO L225 Difference]: With dead ends: 3027 [2019-10-22 11:24:31,049 INFO L226 Difference]: Without dead ends: 1584 [2019-10-22 11:24:31,051 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:31,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2019-10-22 11:24:31,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1576. [2019-10-22 11:24:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-10-22 11:24:31,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2016 transitions. [2019-10-22 11:24:31,096 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2016 transitions. Word has length 149 [2019-10-22 11:24:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:31,097 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 2016 transitions. [2019-10-22 11:24:31,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:31,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2016 transitions. [2019-10-22 11:24:31,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-22 11:24:31,101 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:31,101 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,102 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:31,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:31,102 INFO L82 PathProgramCache]: Analyzing trace with hash -572408455, now seen corresponding path program 1 times [2019-10-22 11:24:31,102 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:31,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947897681] [2019-10-22 11:24:31,103 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:31,103 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:31,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 11:24:31,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947897681] [2019-10-22 11:24:31,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:31,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:31,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749687514] [2019-10-22 11:24:31,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:31,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:31,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:31,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:31,235 INFO L87 Difference]: Start difference. First operand 1576 states and 2016 transitions. Second operand 5 states. [2019-10-22 11:24:32,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:32,162 INFO L93 Difference]: Finished difference Result 3281 states and 4233 transitions. [2019-10-22 11:24:32,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:32,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-22 11:24:32,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:32,169 INFO L225 Difference]: With dead ends: 3281 [2019-10-22 11:24:32,170 INFO L226 Difference]: Without dead ends: 1838 [2019-10-22 11:24:32,172 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:32,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-10-22 11:24:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-10-22 11:24:32,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-10-22 11:24:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2308 transitions. [2019-10-22 11:24:32,214 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2308 transitions. Word has length 153 [2019-10-22 11:24:32,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:32,214 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2308 transitions. [2019-10-22 11:24:32,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:32,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2308 transitions. [2019-10-22 11:24:32,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-22 11:24:32,218 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:32,218 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,218 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:32,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:32,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1905945086, now seen corresponding path program 1 times [2019-10-22 11:24:32,219 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:32,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649398587] [2019-10-22 11:24:32,220 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:32,220 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:32,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 11:24:32,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649398587] [2019-10-22 11:24:32,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:32,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:32,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152916096] [2019-10-22 11:24:32,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:32,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:32,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:32,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:32,279 INFO L87 Difference]: Start difference. First operand 1838 states and 2308 transitions. Second operand 3 states. [2019-10-22 11:24:32,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:32,775 INFO L93 Difference]: Finished difference Result 4329 states and 5505 transitions. [2019-10-22 11:24:32,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:32,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-22 11:24:32,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:32,783 INFO L225 Difference]: With dead ends: 4329 [2019-10-22 11:24:32,783 INFO L226 Difference]: Without dead ends: 2362 [2019-10-22 11:24:32,785 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:24:32,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-10-22 11:24:32,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1969. [2019-10-22 11:24:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-10-22 11:24:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2242 transitions. [2019-10-22 11:24:32,830 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2242 transitions. Word has length 156 [2019-10-22 11:24:32,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:32,830 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2242 transitions. [2019-10-22 11:24:32,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2242 transitions. [2019-10-22 11:24:32,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-22 11:24:32,835 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:32,835 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,835 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:32,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:32,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1955275782, now seen corresponding path program 1 times [2019-10-22 11:24:32,836 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:32,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062287329] [2019-10-22 11:24:32,836 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:32,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:32,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:32,928 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:32,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062287329] [2019-10-22 11:24:32,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:32,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:32,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50667982] [2019-10-22 11:24:32,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:32,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:32,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:32,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:32,930 INFO L87 Difference]: Start difference. First operand 1969 states and 2242 transitions. Second operand 5 states. [2019-10-22 11:24:33,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:33,855 INFO L93 Difference]: Finished difference Result 5246 states and 6053 transitions. [2019-10-22 11:24:33,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:33,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2019-10-22 11:24:33,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:33,866 INFO L225 Difference]: With dead ends: 5246 [2019-10-22 11:24:33,866 INFO L226 Difference]: Without dead ends: 3410 [2019-10-22 11:24:33,869 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:33,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3410 states. [2019-10-22 11:24:33,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3410 to 2755. [2019-10-22 11:24:33,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2755 states. [2019-10-22 11:24:33,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 3075 transitions. [2019-10-22 11:24:33,929 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 3075 transitions. Word has length 171 [2019-10-22 11:24:33,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:33,929 INFO L462 AbstractCegarLoop]: Abstraction has 2755 states and 3075 transitions. [2019-10-22 11:24:33,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:33,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 3075 transitions. [2019-10-22 11:24:33,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-22 11:24:33,936 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:33,936 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,936 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:33,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:33,937 INFO L82 PathProgramCache]: Analyzing trace with hash 731241800, now seen corresponding path program 1 times [2019-10-22 11:24:33,937 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:33,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444048600] [2019-10-22 11:24:33,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:33,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:34,129 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 173 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-22 11:24:34,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444048600] [2019-10-22 11:24:34,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555642048] [2019-10-22 11:24:34,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05025f63-f6bc-4602-8d66-b9e487b97b70/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:24:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:34,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:24:34,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-10-22 11:24:34,397 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-10-22 11:24:34,460 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:24:34,460 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-10-22 11:24:34,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812230637] [2019-10-22 11:24:34,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:34,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:34,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:34,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:34,463 INFO L87 Difference]: Start difference. First operand 2755 states and 3075 transitions. Second operand 3 states. [2019-10-22 11:24:34,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:34,906 INFO L93 Difference]: Finished difference Result 5639 states and 6302 transitions. [2019-10-22 11:24:34,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:34,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-10-22 11:24:34,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:34,917 INFO L225 Difference]: With dead ends: 5639 [2019-10-22 11:24:34,918 INFO L226 Difference]: Without dead ends: 2755 [2019-10-22 11:24:34,921 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 472 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-10-22 11:24:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2493. [2019-10-22 11:24:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2019-10-22 11:24:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2700 transitions. [2019-10-22 11:24:34,980 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2700 transitions. Word has length 237 [2019-10-22 11:24:34,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:34,981 INFO L462 AbstractCegarLoop]: Abstraction has 2493 states and 2700 transitions. [2019-10-22 11:24:34,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2700 transitions. [2019-10-22 11:24:34,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-22 11:24:34,988 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:34,989 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:24:35,190 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:35,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:35,191 INFO L82 PathProgramCache]: Analyzing trace with hash -786840920, now seen corresponding path program 1 times [2019-10-22 11:24:35,191 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:35,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554676957] [2019-10-22 11:24:35,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:35,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:35,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-22 11:24:35,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554676957] [2019-10-22 11:24:35,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:35,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:35,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783680733] [2019-10-22 11:24:35,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:35,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:35,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:35,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:35,355 INFO L87 Difference]: Start difference. First operand 2493 states and 2700 transitions. Second operand 4 states. [2019-10-22 11:24:35,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:35,853 INFO L93 Difference]: Finished difference Result 5508 states and 5981 transitions. [2019-10-22 11:24:35,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:35,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-10-22 11:24:35,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:35,867 INFO L225 Difference]: With dead ends: 5508 [2019-10-22 11:24:35,868 INFO L226 Difference]: Without dead ends: 2886 [2019-10-22 11:24:35,870 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:35,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2019-10-22 11:24:35,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2362. [2019-10-22 11:24:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2362 states. [2019-10-22 11:24:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2557 transitions. [2019-10-22 11:24:35,981 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2557 transitions. Word has length 240 [2019-10-22 11:24:35,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:35,981 INFO L462 AbstractCegarLoop]: Abstraction has 2362 states and 2557 transitions. [2019-10-22 11:24:35,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:35,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2557 transitions. [2019-10-22 11:24:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-22 11:24:35,991 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:35,992 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,992 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:35,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:35,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1721505113, now seen corresponding path program 1 times [2019-10-22 11:24:35,993 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:35,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096491179] [2019-10-22 11:24:35,993 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:35,993 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:35,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:36,185 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 233 proven. 27 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-22 11:24:36,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096491179] [2019-10-22 11:24:36,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159238906] [2019-10-22 11:24:36,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_05025f63-f6bc-4602-8d66-b9e487b97b70/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:24:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:36,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:24:36,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:36,366 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-22 11:24:36,366 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-22 11:24:36,414 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:24:36,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-10-22 11:24:36,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055977100] [2019-10-22 11:24:36,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:36,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:36,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:36,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:36,416 INFO L87 Difference]: Start difference. First operand 2362 states and 2557 transitions. Second operand 3 states. [2019-10-22 11:24:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:36,818 INFO L93 Difference]: Finished difference Result 4982 states and 5390 transitions. [2019-10-22 11:24:36,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:36,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-10-22 11:24:36,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:36,820 INFO L225 Difference]: With dead ends: 4982 [2019-10-22 11:24:36,820 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:24:36,823 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 524 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:36,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:24:36,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:24:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:24:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:24:36,824 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 263 [2019-10-22 11:24:36,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:36,824 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:24:36,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:36,824 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:24:36,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:24:37,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:24:37,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:24:37,174 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2019-10-22 11:24:37,743 WARN L191 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 48 [2019-10-22 11:24:38,232 WARN L191 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 48 [2019-10-22 11:24:38,234 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-22 11:24:38,234 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-22 11:24:38,234 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,234 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,234 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,234 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,234 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,234 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,234 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-22 11:24:38,234 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-22 11:24:38,234 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-10-22 11:24:38,234 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-10-22 11:24:38,235 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-10-22 11:24:38,235 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-10-22 11:24:38,235 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-10-22 11:24:38,235 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-10-22 11:24:38,236 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-22 11:24:38,236 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-22 11:24:38,237 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,237 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,237 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,237 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,237 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,237 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,237 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-22 11:24:38,237 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-22 11:24:38,237 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-10-22 11:24:38,237 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-10-22 11:24:38,237 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-10-22 11:24:38,237 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-10-22 11:24:38,237 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-10-22 11:24:38,237 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-10-22 11:24:38,237 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-22 11:24:38,238 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-22 11:24:38,238 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-22 11:24:38,238 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-22 11:24:38,238 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-22 11:24:38,238 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-22 11:24:38,238 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-10-22 11:24:38,238 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,238 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,238 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,238 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,238 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,238 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-22 11:24:38,238 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-22 11:24:38,238 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-10-22 11:24:38,239 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-10-22 11:24:38,239 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-10-22 11:24:38,239 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-10-22 11:24:38,239 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-10-22 11:24:38,239 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-10-22 11:24:38,239 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-22 11:24:38,239 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse1 (not (= 14 ~a8~0))) (.cse11 (= ~a21~0 1))) (let ((.cse9 (= 5 ~a16~0)) (.cse0 (= 1 ~a7~0)) (.cse4 (and .cse10 .cse1 .cse11)) (.cse8 (= 15 ~a8~0)) (.cse7 (<= ~a20~0 0)) (.cse5 (<= ~a16~0 4)) (.cse6 (<= 14 ~a8~0)) (.cse12 (not (= ~a16~0 6))) (.cse2 (<= ~a17~0 0)) (.cse3 (= ~a20~0 1))) (or (and (and .cse0 .cse1) .cse2 .cse3) (and .cse4 .cse3) (and .cse0 .cse5) (and .cse4 .cse6 .cse7) (and .cse0 .cse8 .cse9) (and .cse3 .cse8 (not .cse10)) (and .cse0 .cse10 .cse1 .cse3 (= ~a16~0 5)) (and .cse6 .cse9 .cse7) (and .cse0 .cse9 .cse7) (and .cse10 .cse11 .cse3 .cse5) (and .cse0 (and .cse4 .cse12)) (and .cse8 .cse7) (and .cse2 .cse3 .cse5) (and .cse7 .cse5) (and .cse6 .cse12 .cse2 .cse3)))) [2019-10-22 11:24:38,239 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,240 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,240 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,240 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,240 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,240 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-22 11:24:38,240 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-10-22 11:24:38,240 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-10-22 11:24:38,240 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-10-22 11:24:38,240 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-10-22 11:24:38,240 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-10-22 11:24:38,240 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-22 11:24:38,240 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-22 11:24:38,240 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-22 11:24:38,240 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-22 11:24:38,241 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-22 11:24:38,241 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-22 11:24:38,241 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-22 11:24:38,241 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-10-22 11:24:38,241 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,241 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,241 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,241 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,241 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,241 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-22 11:24:38,241 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-22 11:24:38,241 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-22 11:24:38,241 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 539) no Hoare annotation was computed. [2019-10-22 11:24:38,242 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-10-22 11:24:38,242 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-10-22 11:24:38,242 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-10-22 11:24:38,242 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-10-22 11:24:38,242 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-10-22 11:24:38,242 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-22 11:24:38,242 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,242 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,242 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,242 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,242 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-22 11:24:38,242 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,242 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-22 11:24:38,243 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-22 11:24:38,243 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-10-22 11:24:38,243 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-10-22 11:24:38,243 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-10-22 11:24:38,252 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-10-22 11:24:38,252 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-10-22 11:24:38,252 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:24:38,252 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-22 11:24:38,253 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-22 11:24:38,253 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-22 11:24:38,253 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-22 11:24:38,253 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-22 11:24:38,253 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-22 11:24:38,253 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,253 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse10 (= ~a17~0 1)) (.cse1 (not (= 14 ~a8~0))) (.cse11 (= ~a21~0 1))) (let ((.cse9 (= 5 ~a16~0)) (.cse0 (= 1 ~a7~0)) (.cse4 (and .cse10 .cse1 .cse11)) (.cse8 (= 15 ~a8~0)) (.cse7 (<= ~a20~0 0)) (.cse5 (<= ~a16~0 4)) (.cse6 (<= 14 ~a8~0)) (.cse12 (not (= ~a16~0 6))) (.cse2 (<= ~a17~0 0)) (.cse3 (= ~a20~0 1))) (or (and (and .cse0 .cse1) .cse2 .cse3) (and .cse4 .cse3) (and .cse0 .cse5) (and .cse4 .cse6 .cse7) (and .cse0 .cse8 .cse9) (and .cse3 .cse8 (not .cse10)) (and .cse0 .cse10 .cse1 .cse3 (= ~a16~0 5)) (and .cse6 .cse9 .cse7) (and .cse0 .cse9 .cse7) (and .cse10 .cse11 .cse3 .cse5) (and .cse0 (and .cse4 .cse12)) (and .cse8 .cse7) (and .cse2 .cse3 .cse5) (and .cse7 .cse5) (and .cse6 .cse12 .cse2 .cse3)))) [2019-10-22 11:24:38,253 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,253 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,253 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,254 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,254 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-22 11:24:38,254 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-10-22 11:24:38,254 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-10-22 11:24:38,254 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-10-22 11:24:38,254 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-10-22 11:24:38,254 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-10-22 11:24:38,254 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-22 11:24:38,254 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-22 11:24:38,254 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,254 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,254 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,254 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,254 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,255 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-22 11:24:38,255 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:24:38,255 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-22 11:24:38,255 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-22 11:24:38,255 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-22 11:24:38,255 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-10-22 11:24:38,255 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-10-22 11:24:38,255 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-10-22 11:24:38,255 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-10-22 11:24:38,255 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-10-22 11:24:38,255 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-22 11:24:38,255 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-22 11:24:38,256 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-22 11:24:38,256 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,256 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,256 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,256 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,256 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-10-22 11:24:38,256 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,256 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,256 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-22 11:24:38,256 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-22 11:24:38,256 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:24:38,256 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-10-22 11:24:38,256 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-10-22 11:24:38,256 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-10-22 11:24:38,257 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-10-22 11:24:38,257 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-10-22 11:24:38,257 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-10-22 11:24:38,257 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-22 11:24:38,257 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-22 11:24:38,257 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-22 11:24:38,257 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-22 11:24:38,257 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,257 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,257 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,257 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,257 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,257 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-22 11:24:38,257 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,258 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-22 11:24:38,258 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-22 11:24:38,258 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-10-22 11:24:38,258 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-10-22 11:24:38,258 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-10-22 11:24:38,258 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-10-22 11:24:38,258 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-10-22 11:24:38,258 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-10-22 11:24:38,258 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-22 11:24:38,258 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-22 11:24:38,258 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-22 11:24:38,258 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:24:38,258 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-22 11:24:38,258 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-22 11:24:38,259 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-22 11:24:38,259 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,259 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,259 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,260 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,260 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,260 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:24:38,260 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-22 11:24:38,260 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-10-22 11:24:38,260 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-10-22 11:24:38,261 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-10-22 11:24:38,261 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-10-22 11:24:38,261 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-10-22 11:24:38,261 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-10-22 11:24:38,261 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-22 11:24:38,261 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-22 11:24:38,261 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-22 11:24:38,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:24:38 BoogieIcfgContainer [2019-10-22 11:24:38,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:24:38,293 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:24:38,293 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:24:38,294 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:24:38,294 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:26" (3/4) ... [2019-10-22 11:24:38,297 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:24:38,320 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 11:24:38,325 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:24:38,457 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_05025f63-f6bc-4602-8d66-b9e487b97b70/bin/utaipan/witness.graphml [2019-10-22 11:24:38,459 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:24:38,460 INFO L168 Benchmark]: Toolchain (without parser) took 14123.37 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 428.3 MB). Free memory was 940.5 MB in the beginning and 1.3 GB in the end (delta: -362.0 MB). Peak memory consumption was 66.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:38,460 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:38,461 INFO L168 Benchmark]: CACSL2BoogieTranslator took 709.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:38,461 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:38,461 INFO L168 Benchmark]: Boogie Preprocessor took 69.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:38,461 INFO L168 Benchmark]: RCFGBuilder took 1406.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.0 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:38,462 INFO L168 Benchmark]: TraceAbstraction took 11683.00 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 287.8 MB). Free memory was 992.0 MB in the beginning and 1.3 GB in the end (delta: -336.8 MB). Peak memory consumption was 442.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:38,462 INFO L168 Benchmark]: Witness Printer took 165.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:38,467 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 709.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1406.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.0 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11683.00 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 287.8 MB). Free memory was 992.0 MB in the beginning and 1.3 GB in the end (delta: -336.8 MB). Peak memory consumption was 442.1 MB. Max. memory is 11.5 GB. * Witness Printer took 165.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 539]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((1 == a7 && !(14 == a8)) && a17 <= 0) && a20 == 1) || (((a17 == 1 && !(14 == a8)) && a21 == 1) && a20 == 1)) || (1 == a7 && a16 <= 4)) || ((((a17 == 1 && !(14 == a8)) && a21 == 1) && 14 <= a8) && a20 <= 0)) || ((1 == a7 && 15 == a8) && 5 == a16)) || ((a20 == 1 && 15 == a8) && !(a17 == 1))) || ((((1 == a7 && a17 == 1) && !(14 == a8)) && a20 == 1) && a16 == 5)) || ((14 <= a8 && 5 == a16) && a20 <= 0)) || ((1 == a7 && 5 == a16) && a20 <= 0)) || (((a17 == 1 && a21 == 1) && a20 == 1) && a16 <= 4)) || (1 == a7 && ((a17 == 1 && !(14 == a8)) && a21 == 1) && !(a16 == 6))) || (15 == a8 && a20 <= 0)) || ((a17 <= 0 && a20 == 1) && a16 <= 4)) || (a20 <= 0 && a16 <= 4)) || (((14 <= a8 && !(a16 == 6)) && a17 <= 0) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((1 == a7 && !(14 == a8)) && a17 <= 0) && a20 == 1) || (((a17 == 1 && !(14 == a8)) && a21 == 1) && a20 == 1)) || (1 == a7 && a16 <= 4)) || ((((a17 == 1 && !(14 == a8)) && a21 == 1) && 14 <= a8) && a20 <= 0)) || ((1 == a7 && 15 == a8) && 5 == a16)) || ((a20 == 1 && 15 == a8) && !(a17 == 1))) || ((((1 == a7 && a17 == 1) && !(14 == a8)) && a20 == 1) && a16 == 5)) || ((14 <= a8 && 5 == a16) && a20 <= 0)) || ((1 == a7 && 5 == a16) && a20 <= 0)) || (((a17 == 1 && a21 == 1) && a20 == 1) && a16 <= 4)) || (1 == a7 && ((a17 == 1 && !(14 == a8)) && a21 == 1) && !(a16 == 6))) || (15 == a8 && a20 <= 0)) || ((a17 <= 0 && a20 == 1) && a16 <= 4)) || (a20 <= 0 && a16 <= 4)) || (((14 <= a8 && !(a16 == 6)) && a17 <= 0) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 11.5s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, HoareTripleCheckerStatistics: 823 SDtfs, 2137 SDslu, 102 SDs, 0 SdLazy, 4955 SolverSat, 923 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1038 GetRequests, 1006 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2755occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 2104 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 54 NumberOfFragments, 371 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1679 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1410 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2267 NumberOfCodeBlocks, 2267 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2753 ConstructedInterpolants, 0 QuantifiedInterpolants, 1150000 SizeOfPredicates, 2 NumberOfNonLiveVariables, 887 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2218/2272 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...