./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8c2a9b9f-96ab-4f49-b546-3064ab71993c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8c2a9b9f-96ab-4f49-b546-3064ab71993c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8c2a9b9f-96ab-4f49-b546-3064ab71993c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8c2a9b9f-96ab-4f49-b546-3064ab71993c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label13.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8c2a9b9f-96ab-4f49-b546-3064ab71993c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8c2a9b9f-96ab-4f49-b546-3064ab71993c/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e5c5eed4bd7fab4c39b1476c33057bc1fdb10c3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:57:09,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:57:09,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:57:09,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:57:09,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:57:09,317 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:57:09,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:57:09,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:57:09,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:57:09,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:57:09,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:57:09,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:57:09,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:57:09,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:57:09,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:57:09,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:57:09,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:57:09,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:57:09,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:57:09,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:57:09,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:57:09,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:57:09,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:57:09,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:57:09,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:57:09,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:57:09,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:57:09,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:57:09,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:57:09,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:57:09,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:57:09,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:57:09,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:57:09,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:57:09,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:57:09,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:57:09,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:57:09,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:57:09,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:57:09,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:57:09,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:57:09,371 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8c2a9b9f-96ab-4f49-b546-3064ab71993c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:57:09,394 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:57:09,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:57:09,395 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:57:09,395 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:57:09,396 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:57:09,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:57:09,396 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:57:09,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:57:09,396 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:57:09,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:57:09,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:57:09,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:57:09,397 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:57:09,397 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:57:09,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:57:09,398 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:57:09,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:57:09,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:57:09,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:57:09,398 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:57:09,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:57:09,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:57:09,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:57:09,399 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:57:09,399 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:57:09,399 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:57:09,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:57:09,400 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:57:09,400 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_8c2a9b9f-96ab-4f49-b546-3064ab71993c/bin/uautomizer 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 -> Automizer 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 -> 6e5c5eed4bd7fab4c39b1476c33057bc1fdb10c3 [2019-11-25 08:57:09,583 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:57:09,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:57:09,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:57:09,601 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:57:09,602 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:57:09,603 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8c2a9b9f-96ab-4f49-b546-3064ab71993c/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label13.c [2019-11-25 08:57:09,662 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c2a9b9f-96ab-4f49-b546-3064ab71993c/bin/uautomizer/data/ab5130b45/1622e5b16151414493e0f308b7fb3c8b/FLAGb840aa32e [2019-11-25 08:57:10,124 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:57:10,125 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8c2a9b9f-96ab-4f49-b546-3064ab71993c/sv-benchmarks/c/eca-rers2012/Problem01_label13.c [2019-11-25 08:57:10,140 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c2a9b9f-96ab-4f49-b546-3064ab71993c/bin/uautomizer/data/ab5130b45/1622e5b16151414493e0f308b7fb3c8b/FLAGb840aa32e [2019-11-25 08:57:10,504 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8c2a9b9f-96ab-4f49-b546-3064ab71993c/bin/uautomizer/data/ab5130b45/1622e5b16151414493e0f308b7fb3c8b [2019-11-25 08:57:10,507 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:57:10,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:57:10,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:57:10,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:57:10,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:57:10,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:57:10" (1/1) ... [2019-11-25 08:57:10,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@133f4d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:10, skipping insertion in model container [2019-11-25 08:57:10,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:57:10" (1/1) ... [2019-11-25 08:57:10,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:57:10,570 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:57:10,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:57:10,982 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:57:11,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:57:11,128 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:57:11,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:11 WrapperNode [2019-11-25 08:57:11,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:57:11,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:57:11,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:57:11,129 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:57:11,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:11" (1/1) ... [2019-11-25 08:57:11,165 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:11" (1/1) ... [2019-11-25 08:57:11,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:57:11,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:57:11,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:57:11,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:57:11,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:11" (1/1) ... [2019-11-25 08:57:11,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:11" (1/1) ... [2019-11-25 08:57:11,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:11" (1/1) ... [2019-11-25 08:57:11,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:11" (1/1) ... [2019-11-25 08:57:11,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:11" (1/1) ... [2019-11-25 08:57:11,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:11" (1/1) ... [2019-11-25 08:57:11,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:11" (1/1) ... [2019-11-25 08:57:11,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:57:11,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:57:11,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:57:11,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:57:11,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c2a9b9f-96ab-4f49-b546-3064ab71993c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:57:11,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:57:11,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:57:12,650 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:57:12,650 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:57:12,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:12 BoogieIcfgContainer [2019-11-25 08:57:12,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:57:12,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:57:12,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:57:12,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:57:12,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:57:10" (1/3) ... [2019-11-25 08:57:12,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dfae9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:57:12, skipping insertion in model container [2019-11-25 08:57:12,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:11" (2/3) ... [2019-11-25 08:57:12,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dfae9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:57:12, skipping insertion in model container [2019-11-25 08:57:12,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:12" (3/3) ... [2019-11-25 08:57:12,658 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label13.c [2019-11-25 08:57:12,667 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:57:12,673 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:57:12,682 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:57:12,717 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:57:12,717 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:57:12,718 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:57:12,718 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:57:12,718 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:57:12,718 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:57:12,718 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:57:12,718 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:57:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-25 08:57:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-25 08:57:12,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:12,758 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:12,758 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:12,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:12,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1419855070, now seen corresponding path program 1 times [2019-11-25 08:57:12,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:12,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206092060] [2019-11-25 08:57:12,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:13,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206092060] [2019-11-25 08:57:13,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:13,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:13,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27882788] [2019-11-25 08:57:13,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:13,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:13,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:13,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:13,266 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-25 08:57:14,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:14,573 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-25 08:57:14,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:14,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-11-25 08:57:14,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:14,589 INFO L225 Difference]: With dead ends: 662 [2019-11-25 08:57:14,590 INFO L226 Difference]: Without dead ends: 397 [2019-11-25 08:57:14,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:14,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-25 08:57:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-25 08:57:14,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-25 08:57:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2019-11-25 08:57:14,663 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 123 [2019-11-25 08:57:14,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:14,664 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2019-11-25 08:57:14,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:14,664 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2019-11-25 08:57:14,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-25 08:57:14,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:14,670 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:14,670 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:14,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:14,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1345449990, now seen corresponding path program 1 times [2019-11-25 08:57:14,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:14,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761108269] [2019-11-25 08:57:14,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:14,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:14,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761108269] [2019-11-25 08:57:14,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:14,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:14,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482098253] [2019-11-25 08:57:14,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:14,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:14,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:14,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:14,730 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand 4 states. [2019-11-25 08:57:15,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:15,323 INFO L93 Difference]: Finished difference Result 1185 states and 1672 transitions. [2019-11-25 08:57:15,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:15,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-11-25 08:57:15,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:15,328 INFO L225 Difference]: With dead ends: 1185 [2019-11-25 08:57:15,328 INFO L226 Difference]: Without dead ends: 790 [2019-11-25 08:57:15,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:15,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-25 08:57:15,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-25 08:57:15,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-25 08:57:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-11-25 08:57:15,373 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 128 [2019-11-25 08:57:15,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:15,374 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-11-25 08:57:15,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:15,374 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-11-25 08:57:15,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-25 08:57:15,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:15,377 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:15,377 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:15,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:15,377 INFO L82 PathProgramCache]: Analyzing trace with hash -139497956, now seen corresponding path program 1 times [2019-11-25 08:57:15,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:15,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990006731] [2019-11-25 08:57:15,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-25 08:57:15,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990006731] [2019-11-25 08:57:15,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:15,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:15,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937150700] [2019-11-25 08:57:15,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:15,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:15,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:15,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:15,518 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-11-25 08:57:15,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:15,990 INFO L93 Difference]: Finished difference Result 1971 states and 2686 transitions. [2019-11-25 08:57:15,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:15,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-25 08:57:15,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:15,999 INFO L225 Difference]: With dead ends: 1971 [2019-11-25 08:57:15,999 INFO L226 Difference]: Without dead ends: 1183 [2019-11-25 08:57:16,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:16,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-11-25 08:57:16,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 921. [2019-11-25 08:57:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-25 08:57:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1246 transitions. [2019-11-25 08:57:16,027 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1246 transitions. Word has length 149 [2019-11-25 08:57:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:16,028 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1246 transitions. [2019-11-25 08:57:16,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1246 transitions. [2019-11-25 08:57:16,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-25 08:57:16,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:16,031 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-25 08:57:16,031 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:16,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:16,032 INFO L82 PathProgramCache]: Analyzing trace with hash -2073958119, now seen corresponding path program 1 times [2019-11-25 08:57:16,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:16,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469309] [2019-11-25 08:57:16,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-25 08:57:16,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469309] [2019-11-25 08:57:16,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:16,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:16,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967257193] [2019-11-25 08:57:16,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:16,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:16,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:16,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:16,133 INFO L87 Difference]: Start difference. First operand 921 states and 1246 transitions. Second operand 3 states. [2019-11-25 08:57:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:16,598 INFO L93 Difference]: Finished difference Result 2233 states and 2997 transitions. [2019-11-25 08:57:16,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:16,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-25 08:57:16,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:16,606 INFO L225 Difference]: With dead ends: 2233 [2019-11-25 08:57:16,606 INFO L226 Difference]: Without dead ends: 1314 [2019-11-25 08:57:16,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:16,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-25 08:57:16,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2019-11-25 08:57:16,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-25 08:57:16,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1526 transitions. [2019-11-25 08:57:16,640 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1526 transitions. Word has length 185 [2019-11-25 08:57:16,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:16,640 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1526 transitions. [2019-11-25 08:57:16,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:16,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1526 transitions. [2019-11-25 08:57:16,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-25 08:57:16,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:16,645 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-25 08:57:16,645 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:16,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:16,645 INFO L82 PathProgramCache]: Analyzing trace with hash 146303237, now seen corresponding path program 1 times [2019-11-25 08:57:16,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:16,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085819639] [2019-11-25 08:57:16,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-25 08:57:16,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085819639] [2019-11-25 08:57:16,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:16,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:16,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104341319] [2019-11-25 08:57:16,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:16,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:16,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:16,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:16,806 INFO L87 Difference]: Start difference. First operand 1183 states and 1526 transitions. Second operand 4 states. [2019-11-25 08:57:17,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:17,476 INFO L93 Difference]: Finished difference Result 2500 states and 3204 transitions. [2019-11-25 08:57:17,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:57:17,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-25 08:57:17,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:17,483 INFO L225 Difference]: With dead ends: 2500 [2019-11-25 08:57:17,484 INFO L226 Difference]: Without dead ends: 1319 [2019-11-25 08:57:17,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:57:17,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-11-25 08:57:17,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1314. [2019-11-25 08:57:17,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-25 08:57:17,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1663 transitions. [2019-11-25 08:57:17,523 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1663 transitions. Word has length 193 [2019-11-25 08:57:17,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:17,524 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1663 transitions. [2019-11-25 08:57:17,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:17,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1663 transitions. [2019-11-25 08:57:17,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-25 08:57:17,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:17,528 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-25 08:57:17,529 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:17,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:17,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1732240947, now seen corresponding path program 1 times [2019-11-25 08:57:17,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:17,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537723014] [2019-11-25 08:57:17,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-25 08:57:17,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537723014] [2019-11-25 08:57:17,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:17,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:17,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382294882] [2019-11-25 08:57:17,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:57:17,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:17,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:57:17,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:57:17,636 INFO L87 Difference]: Start difference. First operand 1314 states and 1663 transitions. Second operand 5 states. [2019-11-25 08:57:18,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:18,652 INFO L93 Difference]: Finished difference Result 2757 states and 3527 transitions. [2019-11-25 08:57:18,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:57:18,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 197 [2019-11-25 08:57:18,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:18,685 INFO L225 Difference]: With dead ends: 2757 [2019-11-25 08:57:18,685 INFO L226 Difference]: Without dead ends: 1576 [2019-11-25 08:57:18,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:57:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-25 08:57:18,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-11-25 08:57:18,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-25 08:57:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1949 transitions. [2019-11-25 08:57:18,725 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1949 transitions. Word has length 197 [2019-11-25 08:57:18,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:18,727 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1949 transitions. [2019-11-25 08:57:18,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:57:18,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1949 transitions. [2019-11-25 08:57:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-25 08:57:18,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:18,732 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-25 08:57:18,732 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:18,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:18,741 INFO L82 PathProgramCache]: Analyzing trace with hash -794045742, now seen corresponding path program 1 times [2019-11-25 08:57:18,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:18,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043107236] [2019-11-25 08:57:18,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:18,820 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-25 08:57:18,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043107236] [2019-11-25 08:57:18,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:18,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:18,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224970962] [2019-11-25 08:57:18,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:18,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:18,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:18,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:18,831 INFO L87 Difference]: Start difference. First operand 1576 states and 1949 transitions. Second operand 3 states. [2019-11-25 08:57:19,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:19,340 INFO L93 Difference]: Finished difference Result 3412 states and 4236 transitions. [2019-11-25 08:57:19,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:19,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-11-25 08:57:19,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:19,349 INFO L225 Difference]: With dead ends: 3412 [2019-11-25 08:57:19,349 INFO L226 Difference]: Without dead ends: 1707 [2019-11-25 08:57:19,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:19,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-25 08:57:19,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2019-11-25 08:57:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-25 08:57:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1732 transitions. [2019-11-25 08:57:19,385 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1732 transitions. Word has length 200 [2019-11-25 08:57:19,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:19,386 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1732 transitions. [2019-11-25 08:57:19,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:19,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1732 transitions. [2019-11-25 08:57:19,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-25 08:57:19,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:19,392 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:19,392 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:19,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:19,392 INFO L82 PathProgramCache]: Analyzing trace with hash 933247694, now seen corresponding path program 1 times [2019-11-25 08:57:19,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:19,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167235305] [2019-11-25 08:57:19,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-25 08:57:19,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167235305] [2019-11-25 08:57:19,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:19,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:19,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617285869] [2019-11-25 08:57:19,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:19,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:19,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:19,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:19,517 INFO L87 Difference]: Start difference. First operand 1576 states and 1732 transitions. Second operand 3 states. [2019-11-25 08:57:19,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:19,873 INFO L93 Difference]: Finished difference Result 3543 states and 3930 transitions. [2019-11-25 08:57:19,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:19,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-11-25 08:57:19,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:19,883 INFO L225 Difference]: With dead ends: 3543 [2019-11-25 08:57:19,884 INFO L226 Difference]: Without dead ends: 2100 [2019-11-25 08:57:19,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:19,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-25 08:57:19,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2019-11-25 08:57:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-25 08:57:19,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2004 transitions. [2019-11-25 08:57:19,923 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2004 transitions. Word has length 215 [2019-11-25 08:57:19,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:19,924 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2004 transitions. [2019-11-25 08:57:19,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:19,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2004 transitions. [2019-11-25 08:57:19,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-25 08:57:19,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:19,930 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:19,930 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:19,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:19,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1158107046, now seen corresponding path program 1 times [2019-11-25 08:57:19,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:19,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611731616] [2019-11-25 08:57:19,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-25 08:57:20,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611731616] [2019-11-25 08:57:20,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977685419] [2019-11-25 08:57:20,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c2a9b9f-96ab-4f49-b546-3064ab71993c/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:20,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:57:20,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-25 08:57:20,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:57:20,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-25 08:57:20,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140670164] [2019-11-25 08:57:20,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:20,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:20,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:20,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:57:20,467 INFO L87 Difference]: Start difference. First operand 1838 states and 2004 transitions. Second operand 3 states. [2019-11-25 08:57:20,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:20,877 INFO L93 Difference]: Finished difference Result 1840 states and 2005 transitions. [2019-11-25 08:57:20,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:20,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-11-25 08:57:20,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:20,886 INFO L225 Difference]: With dead ends: 1840 [2019-11-25 08:57:20,886 INFO L226 Difference]: Without dead ends: 1838 [2019-11-25 08:57:20,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:57:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-25 08:57:20,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2019-11-25 08:57:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-25 08:57:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1851 transitions. [2019-11-25 08:57:20,921 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1851 transitions. Word has length 244 [2019-11-25 08:57:20,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:20,921 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1851 transitions. [2019-11-25 08:57:20,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1851 transitions. [2019-11-25 08:57:20,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-25 08:57:20,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:20,928 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:21,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:21,141 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:21,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:21,141 INFO L82 PathProgramCache]: Analyzing trace with hash -288373199, now seen corresponding path program 1 times [2019-11-25 08:57:21,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:21,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733462986] [2019-11-25 08:57:21,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 173 proven. 27 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-25 08:57:21,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733462986] [2019-11-25 08:57:21,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315574465] [2019-11-25 08:57:21,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c2a9b9f-96ab-4f49-b546-3064ab71993c/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:21,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:57:21,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:21,659 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-25 08:57:21,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:57:21,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-25 08:57:21,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779558421] [2019-11-25 08:57:21,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:21,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:21,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:21,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:57:21,662 INFO L87 Difference]: Start difference. First operand 1707 states and 1851 transitions. Second operand 3 states. [2019-11-25 08:57:22,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:22,067 INFO L93 Difference]: Finished difference Result 3672 states and 3998 transitions. [2019-11-25 08:57:22,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:22,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-11-25 08:57:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:22,069 INFO L225 Difference]: With dead ends: 3672 [2019-11-25 08:57:22,069 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:57:22,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:57:22,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:57:22,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:57:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:57:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:57:22,073 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 268 [2019-11-25 08:57:22,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:22,073 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:57:22,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:22,073 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:57:22,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:57:22,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:22,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:57:22,474 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 25 [2019-11-25 08:57:22,593 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 25 [2019-11-25 08:57:22,596 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-25 08:57:22,596 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-25 08:57:22,596 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,596 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,596 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,596 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,597 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,597 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,597 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-25 08:57:22,597 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-25 08:57:22,597 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-25 08:57:22,597 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-25 08:57:22,597 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-25 08:57:22,597 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-25 08:57:22,597 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-25 08:57:22,598 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-25 08:57:22,598 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-25 08:57:22,598 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-25 08:57:22,598 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,598 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,598 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,598 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,598 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,598 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,600 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-25 08:57:22,600 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-25 08:57:22,600 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-25 08:57:22,600 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-25 08:57:22,600 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-25 08:57:22,601 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-25 08:57:22,601 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-25 08:57:22,601 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-25 08:57:22,601 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-25 08:57:22,601 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-25 08:57:22,601 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-25 08:57:22,601 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-25 08:57:22,601 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-25 08:57:22,601 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-25 08:57:22,601 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-25 08:57:22,602 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,602 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,602 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,602 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,602 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,602 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-25 08:57:22,602 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-25 08:57:22,602 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-25 08:57:22,602 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-25 08:57:22,602 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-25 08:57:22,603 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-25 08:57:22,603 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-25 08:57:22,603 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-25 08:57:22,603 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-25 08:57:22,603 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1)) (.cse1 (<= ~a8~0 13))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse1 (= ~a17~0 1) .cse0 (= ~a20~0 1)) (and .cse0 (= 15 ~a8~0)) (and .cse1 (= 1 ~a7~0) (<= ~a21~0 0)))) [2019-11-25 08:57:22,603 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,603 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,604 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,604 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,604 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,604 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-25 08:57:22,604 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-25 08:57:22,604 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-25 08:57:22,604 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-25 08:57:22,604 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-25 08:57:22,604 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-25 08:57:22,604 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-25 08:57:22,605 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-25 08:57:22,605 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-25 08:57:22,605 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-25 08:57:22,605 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-25 08:57:22,605 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-25 08:57:22,605 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-25 08:57:22,605 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-25 08:57:22,605 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,605 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,605 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,606 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,606 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,606 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-25 08:57:22,606 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-25 08:57:22,608 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-25 08:57:22,608 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-25 08:57:22,608 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-25 08:57:22,608 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-25 08:57:22,608 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-25 08:57:22,608 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-25 08:57:22,608 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-25 08:57:22,608 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,608 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,608 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,608 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,609 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-25 08:57:22,609 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,609 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-25 08:57:22,609 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-25 08:57:22,609 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-25 08:57:22,609 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-25 08:57:22,609 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-25 08:57:22,609 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-25 08:57:22,609 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-25 08:57:22,609 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:57:22,609 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-25 08:57:22,610 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-25 08:57:22,610 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-25 08:57:22,610 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-25 08:57:22,610 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-25 08:57:22,610 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-25 08:57:22,610 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,610 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1)) (.cse1 (<= ~a8~0 13))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse1 (= ~a17~0 1) .cse0 (= ~a20~0 1)) (and .cse0 (= 15 ~a8~0)) (and .cse1 (= 1 ~a7~0) (<= ~a21~0 0)))) [2019-11-25 08:57:22,610 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,610 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,610 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,611 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,611 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-25 08:57:22,611 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-25 08:57:22,611 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-25 08:57:22,611 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-25 08:57:22,611 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-25 08:57:22,611 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-25 08:57:22,611 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-25 08:57:22,611 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-25 08:57:22,611 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,611 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,612 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,612 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,612 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,612 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-25 08:57:22,612 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:57:22,612 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-25 08:57:22,612 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-25 08:57:22,612 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-25 08:57:22,612 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-25 08:57:22,612 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-25 08:57:22,612 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-25 08:57:22,613 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-25 08:57:22,613 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-25 08:57:22,613 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-25 08:57:22,613 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-25 08:57:22,613 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-25 08:57:22,613 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,613 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,613 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,613 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,613 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-25 08:57:22,613 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,614 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,614 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-25 08:57:22,614 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-25 08:57:22,614 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:57:22,614 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-25 08:57:22,614 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-25 08:57:22,614 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-25 08:57:22,614 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-25 08:57:22,614 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-25 08:57:22,615 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-25 08:57:22,615 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-25 08:57:22,615 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-25 08:57:22,615 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-25 08:57:22,615 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-25 08:57:22,615 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,615 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,615 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,616 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,616 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,616 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-25 08:57:22,616 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,616 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-25 08:57:22,616 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-25 08:57:22,616 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-25 08:57:22,617 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-25 08:57:22,617 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-25 08:57:22,617 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-25 08:57:22,617 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-25 08:57:22,617 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-25 08:57:22,617 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-25 08:57:22,617 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-25 08:57:22,617 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-25 08:57:22,618 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:57:22,618 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 545) no Hoare annotation was computed. [2019-11-25 08:57:22,618 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-25 08:57:22,618 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-25 08:57:22,618 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-25 08:57:22,618 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,619 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,619 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,619 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,619 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,619 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:57:22,619 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-25 08:57:22,619 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-25 08:57:22,620 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-25 08:57:22,620 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-25 08:57:22,620 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-25 08:57:22,620 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-25 08:57:22,620 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-25 08:57:22,620 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-25 08:57:22,620 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-25 08:57:22,620 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-25 08:57:22,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:57:22 BoogieIcfgContainer [2019-11-25 08:57:22,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:57:22,641 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:57:22,641 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:57:22,642 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:57:22,642 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:12" (3/4) ... [2019-11-25 08:57:22,645 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:57:22,676 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:57:22,677 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:57:22,792 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8c2a9b9f-96ab-4f49-b546-3064ab71993c/bin/uautomizer/witness.graphml [2019-11-25 08:57:22,792 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:57:22,794 INFO L168 Benchmark]: Toolchain (without parser) took 12285.64 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 396.4 MB). Free memory was 944.6 MB in the beginning and 1.2 GB in the end (delta: -213.0 MB). Peak memory consumption was 183.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:22,794 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:57:22,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 619.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:22,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.98 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-11-25 08:57:22,795 INFO L168 Benchmark]: Boogie Preprocessor took 66.28 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-11-25 08:57:22,795 INFO L168 Benchmark]: RCFGBuilder took 1379.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 980.1 MB in the end (delta: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:22,796 INFO L168 Benchmark]: TraceAbstraction took 9988.56 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 267.9 MB). Free memory was 980.1 MB in the beginning and 1.2 GB in the end (delta: -203.0 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:22,796 INFO L168 Benchmark]: Witness Printer took 151.41 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:22,798 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 619.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -155.4 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.98 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 66.28 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 1379.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 980.1 MB in the end (delta: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9988.56 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 267.9 MB). Free memory was 980.1 MB in the beginning and 1.2 GB in the end (delta: -203.0 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. * Witness Printer took 151.41 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 545]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((!(a16 == 6) && a21 == 1) || (((a8 <= 13 && a17 == 1) && a21 == 1) && a20 == 1)) || (a21 == 1 && 15 == a8)) || ((a8 <= 13 && 1 == a7) && a21 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((!(a16 == 6) && a21 == 1) || (((a8 <= 13 && a17 == 1) && a21 == 1) && a20 == 1)) || (a21 == 1 && 15 == a8)) || ((a8 <= 13 && 1 == a7) && a21 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 9.9s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 889 SDtfs, 1766 SDslu, 90 SDs, 0 SdLazy, 4474 SolverSat, 672 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 521 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 922 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 79 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1953 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 232 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2414 NumberOfCodeBlocks, 2414 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2402 ConstructedInterpolants, 0 QuantifiedInterpolants, 1062390 SizeOfPredicates, 2 NumberOfNonLiveVariables, 889 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 1912/1966 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...