./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ca18cef0-95ff-4dfd-b63d-605d051575ff/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ca18cef0-95ff-4dfd-b63d-605d051575ff/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ca18cef0-95ff-4dfd-b63d-605d051575ff/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ca18cef0-95ff-4dfd-b63d-605d051575ff/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label05.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ca18cef0-95ff-4dfd-b63d-605d051575ff/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ca18cef0-95ff-4dfd-b63d-605d051575ff/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 6893c9ea3ad65b75d2a8fdb58db378617d0e1a5f ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:26:59,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:26:59,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:26:59,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:26:59,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:26:59,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:26:59,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:26:59,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:26:59,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:26:59,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:26:59,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:26:59,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:26:59,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:26:59,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:26:59,376 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:26:59,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:26:59,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:26:59,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:26:59,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:26:59,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:26:59,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:26:59,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:26:59,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:26:59,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:26:59,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:26:59,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:26:59,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:26:59,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:26:59,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:26:59,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:26:59,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:26:59,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:26:59,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:26:59,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:26:59,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:26:59,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:26:59,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:26:59,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:26:59,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:26:59,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:26:59,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:26:59,404 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ca18cef0-95ff-4dfd-b63d-605d051575ff/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:26:59,417 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:26:59,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:26:59,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:26:59,419 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:26:59,419 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:26:59,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:26:59,420 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:26:59,420 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:26:59,420 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:26:59,420 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:26:59,420 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:26:59,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:26:59,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:26:59,421 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:26:59,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:26:59,421 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:26:59,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:26:59,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:26:59,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:26:59,422 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:26:59,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:26:59,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:26:59,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:26:59,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:26:59,423 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:26:59,424 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:26:59,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:26:59,424 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:26:59,424 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_ca18cef0-95ff-4dfd-b63d-605d051575ff/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 -> 6893c9ea3ad65b75d2a8fdb58db378617d0e1a5f [2019-11-16 00:26:59,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:26:59,462 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:26:59,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:26:59,467 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:26:59,467 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:26:59,468 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ca18cef0-95ff-4dfd-b63d-605d051575ff/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label05.c [2019-11-16 00:26:59,527 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ca18cef0-95ff-4dfd-b63d-605d051575ff/bin/uautomizer/data/2f8d9927c/d0bf8bec62e2482c85dcb44abdefc254/FLAGbf17bc427 [2019-11-16 00:27:00,035 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:27:00,035 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ca18cef0-95ff-4dfd-b63d-605d051575ff/sv-benchmarks/c/eca-rers2012/Problem01_label05.c [2019-11-16 00:27:00,054 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ca18cef0-95ff-4dfd-b63d-605d051575ff/bin/uautomizer/data/2f8d9927c/d0bf8bec62e2482c85dcb44abdefc254/FLAGbf17bc427 [2019-11-16 00:27:00,538 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ca18cef0-95ff-4dfd-b63d-605d051575ff/bin/uautomizer/data/2f8d9927c/d0bf8bec62e2482c85dcb44abdefc254 [2019-11-16 00:27:00,540 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:27:00,541 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:27:00,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:27:00,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:27:00,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:27:00,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:27:00" (1/1) ... [2019-11-16 00:27:00,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f0d4389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:00, skipping insertion in model container [2019-11-16 00:27:00,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:27:00" (1/1) ... [2019-11-16 00:27:00,555 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:27:00,613 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:27:01,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:27:01,053 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:27:01,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:27:01,185 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:27:01,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01 WrapperNode [2019-11-16 00:27:01,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:27:01,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:27:01,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:27:01,187 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:27:01,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... [2019-11-16 00:27:01,223 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... [2019-11-16 00:27:01,302 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:27:01,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:27:01,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:27:01,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:27:01,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... [2019-11-16 00:27:01,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... [2019-11-16 00:27:01,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... [2019-11-16 00:27:01,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... [2019-11-16 00:27:01,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... [2019-11-16 00:27:01,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... [2019-11-16 00:27:01,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... [2019-11-16 00:27:01,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:27:01,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:27:01,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:27:01,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:27:01,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ca18cef0-95ff-4dfd-b63d-605d051575ff/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-16 00:27:01,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:27:01,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:27:02,634 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:27:02,634 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:27:02,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:27:02 BoogieIcfgContainer [2019-11-16 00:27:02,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:27:02,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:27:02,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:27:02,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:27:02,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:27:00" (1/3) ... [2019-11-16 00:27:02,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ff4d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:27:02, skipping insertion in model container [2019-11-16 00:27:02,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01" (2/3) ... [2019-11-16 00:27:02,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ff4d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:27:02, skipping insertion in model container [2019-11-16 00:27:02,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:27:02" (3/3) ... [2019-11-16 00:27:02,642 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label05.c [2019-11-16 00:27:02,651 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:27:02,662 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:27:02,670 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:27:02,693 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:27:02,693 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:27:02,697 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:27:02,697 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:27:02,698 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:27:02,698 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:27:02,698 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:27:02,698 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:27:02,717 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-16 00:27:02,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:27:02,727 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:02,728 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:02,729 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:02,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:02,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1877985287, now seen corresponding path program 1 times [2019-11-16 00:27:02,743 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:02,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940857531] [2019-11-16 00:27:02,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:02,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:02,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:03,118 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-16 00:27:03,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940857531] [2019-11-16 00:27:03,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:03,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:27:03,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521556688] [2019-11-16 00:27:03,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:27:03,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:03,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:27:03,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:27:03,144 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-16 00:27:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:04,848 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-16 00:27:04,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:27:04,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-16 00:27:04,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:04,867 INFO L225 Difference]: With dead ends: 662 [2019-11-16 00:27:04,867 INFO L226 Difference]: Without dead ends: 397 [2019-11-16 00:27:04,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:27:04,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-16 00:27:04,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-11-16 00:27:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-16 00:27:04,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-16 00:27:04,928 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 94 [2019-11-16 00:27:04,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:04,929 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-16 00:27:04,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:27:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-16 00:27:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-16 00:27:04,935 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:04,935 INFO L380 BasicCegarLoop]: trace histogram [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-16 00:27:04,935 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:04,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:04,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1993122394, now seen corresponding path program 1 times [2019-11-16 00:27:04,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:04,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032369715] [2019-11-16 00:27:04,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:04,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:04,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:05,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:05,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032369715] [2019-11-16 00:27:05,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:05,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:27:05,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760431769] [2019-11-16 00:27:05,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:27:05,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:05,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:27:05,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:27:05,017 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-16 00:27:05,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:05,932 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-11-16 00:27:05,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:27:05,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-16 00:27:05,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:05,939 INFO L225 Difference]: With dead ends: 1054 [2019-11-16 00:27:05,939 INFO L226 Difference]: Without dead ends: 790 [2019-11-16 00:27:05,942 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:27:05,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-16 00:27:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-16 00:27:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-16 00:27:06,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1067 transitions. [2019-11-16 00:27:06,001 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1067 transitions. Word has length 100 [2019-11-16 00:27:06,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:06,001 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1067 transitions. [2019-11-16 00:27:06,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:27:06,001 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1067 transitions. [2019-11-16 00:27:06,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-16 00:27:06,021 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:06,021 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:06,022 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:06,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:06,022 INFO L82 PathProgramCache]: Analyzing trace with hash 2028903770, now seen corresponding path program 1 times [2019-11-16 00:27:06,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:06,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589569574] [2019-11-16 00:27:06,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:06,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:06,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:27:06,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589569574] [2019-11-16 00:27:06,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:06,186 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:27:06,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641045518] [2019-11-16 00:27:06,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:06,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:06,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:06,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:06,194 INFO L87 Difference]: Start difference. First operand 790 states and 1067 transitions. Second operand 3 states. [2019-11-16 00:27:06,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:06,818 INFO L93 Difference]: Finished difference Result 2102 states and 2831 transitions. [2019-11-16 00:27:06,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:06,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-16 00:27:06,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:06,830 INFO L225 Difference]: With dead ends: 2102 [2019-11-16 00:27:06,830 INFO L226 Difference]: Without dead ends: 1314 [2019-11-16 00:27:06,834 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:06,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-16 00:27:06,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1052. [2019-11-16 00:27:06,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-11-16 00:27:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1328 transitions. [2019-11-16 00:27:06,870 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1328 transitions. Word has length 101 [2019-11-16 00:27:06,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:06,871 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1328 transitions. [2019-11-16 00:27:06,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:06,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1328 transitions. [2019-11-16 00:27:06,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-16 00:27:06,875 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:06,875 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:27:06,876 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:06,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:06,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1582856459, now seen corresponding path program 1 times [2019-11-16 00:27:06,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:06,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127066910] [2019-11-16 00:27:06,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:06,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:06,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:07,005 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:27:07,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127066910] [2019-11-16 00:27:07,006 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:07,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:27:07,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126067800] [2019-11-16 00:27:07,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:07,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:07,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:07,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:07,010 INFO L87 Difference]: Start difference. First operand 1052 states and 1328 transitions. Second operand 3 states. [2019-11-16 00:27:07,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:07,628 INFO L93 Difference]: Finished difference Result 2364 states and 3019 transitions. [2019-11-16 00:27:07,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:07,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-11-16 00:27:07,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:07,636 INFO L225 Difference]: With dead ends: 2364 [2019-11-16 00:27:07,636 INFO L226 Difference]: Without dead ends: 1314 [2019-11-16 00:27:07,638 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-16 00:27:07,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2019-11-16 00:27:07,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-16 00:27:07,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1502 transitions. [2019-11-16 00:27:07,677 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1502 transitions. Word has length 128 [2019-11-16 00:27:07,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:07,677 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1502 transitions. [2019-11-16 00:27:07,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:07,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1502 transitions. [2019-11-16 00:27:07,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-16 00:27:07,681 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:07,681 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:27:07,681 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:07,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:07,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1986645786, now seen corresponding path program 1 times [2019-11-16 00:27:07,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:07,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636804411] [2019-11-16 00:27:07,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:07,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:07,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:27:07,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636804411] [2019-11-16 00:27:07,796 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:07,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:27:07,796 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990749926] [2019-11-16 00:27:07,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:07,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:07,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:07,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:07,800 INFO L87 Difference]: Start difference. First operand 1183 states and 1502 transitions. Second operand 3 states. [2019-11-16 00:27:08,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:08,512 INFO L93 Difference]: Finished difference Result 3150 states and 3980 transitions. [2019-11-16 00:27:08,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:08,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-16 00:27:08,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:08,525 INFO L225 Difference]: With dead ends: 3150 [2019-11-16 00:27:08,526 INFO L226 Difference]: Without dead ends: 1969 [2019-11-16 00:27:08,528 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:08,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-16 00:27:08,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-11-16 00:27:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-16 00:27:08,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2265 transitions. [2019-11-16 00:27:08,584 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2265 transitions. Word has length 152 [2019-11-16 00:27:08,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:08,585 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2265 transitions. [2019-11-16 00:27:08,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:08,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2265 transitions. [2019-11-16 00:27:08,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-16 00:27:08,591 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:08,591 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:27:08,592 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:08,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:08,592 INFO L82 PathProgramCache]: Analyzing trace with hash -27987931, now seen corresponding path program 1 times [2019-11-16 00:27:08,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:08,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069247885] [2019-11-16 00:27:08,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:08,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:08,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:08,689 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-16 00:27:08,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069247885] [2019-11-16 00:27:08,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:08,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:27:08,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436489098] [2019-11-16 00:27:08,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:08,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:08,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:08,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:08,693 INFO L87 Difference]: Start difference. First operand 1838 states and 2265 transitions. Second operand 3 states. [2019-11-16 00:27:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:09,267 INFO L93 Difference]: Finished difference Result 3674 states and 4528 transitions. [2019-11-16 00:27:09,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:09,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-16 00:27:09,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:09,280 INFO L225 Difference]: With dead ends: 3674 [2019-11-16 00:27:09,281 INFO L226 Difference]: Without dead ends: 1838 [2019-11-16 00:27:09,284 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:09,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-16 00:27:09,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2019-11-16 00:27:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-16 00:27:09,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2110 transitions. [2019-11-16 00:27:09,336 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2110 transitions. Word has length 157 [2019-11-16 00:27:09,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:09,336 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2110 transitions. [2019-11-16 00:27:09,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:09,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2110 transitions. [2019-11-16 00:27:09,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-16 00:27:09,342 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:09,342 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:27:09,343 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:09,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:09,351 INFO L82 PathProgramCache]: Analyzing trace with hash 639923582, now seen corresponding path program 1 times [2019-11-16 00:27:09,351 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:09,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144589297] [2019-11-16 00:27:09,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:09,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:09,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:09,485 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-16 00:27:09,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144589297] [2019-11-16 00:27:09,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:09,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:27:09,486 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332545329] [2019-11-16 00:27:09,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:09,487 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:09,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:09,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:09,488 INFO L87 Difference]: Start difference. First operand 1707 states and 2110 transitions. Second operand 3 states. [2019-11-16 00:27:10,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:10,136 INFO L93 Difference]: Finished difference Result 3543 states and 4361 transitions. [2019-11-16 00:27:10,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:10,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-11-16 00:27:10,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:10,150 INFO L225 Difference]: With dead ends: 3543 [2019-11-16 00:27:10,150 INFO L226 Difference]: Without dead ends: 1838 [2019-11-16 00:27:10,153 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:10,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-16 00:27:10,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-16 00:27:10,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-16 00:27:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2229 transitions. [2019-11-16 00:27:10,262 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2229 transitions. Word has length 177 [2019-11-16 00:27:10,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:10,263 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2229 transitions. [2019-11-16 00:27:10,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2229 transitions. [2019-11-16 00:27:10,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-16 00:27:10,269 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:10,269 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:27:10,270 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:10,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:10,270 INFO L82 PathProgramCache]: Analyzing trace with hash 502707782, now seen corresponding path program 1 times [2019-11-16 00:27:10,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:10,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894132345] [2019-11-16 00:27:10,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:10,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:10,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-16 00:27:10,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894132345] [2019-11-16 00:27:10,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:10,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:27:10,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551034406] [2019-11-16 00:27:10,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:27:10,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:10,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:27:10,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:27:10,505 INFO L87 Difference]: Start difference. First operand 1838 states and 2229 transitions. Second operand 8 states. [2019-11-16 00:27:11,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:11,747 INFO L93 Difference]: Finished difference Result 3844 states and 4632 transitions. [2019-11-16 00:27:11,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:27:11,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2019-11-16 00:27:11,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:11,762 INFO L225 Difference]: With dead ends: 3844 [2019-11-16 00:27:11,763 INFO L226 Difference]: Without dead ends: 2008 [2019-11-16 00:27:11,767 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:27:11,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2019-11-16 00:27:11,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1838. [2019-11-16 00:27:11,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-16 00:27:11,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2217 transitions. [2019-11-16 00:27:11,825 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2217 transitions. Word has length 181 [2019-11-16 00:27:11,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:11,826 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2217 transitions. [2019-11-16 00:27:11,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:27:11,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2217 transitions. [2019-11-16 00:27:11,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-16 00:27:11,832 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:11,832 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:27:11,833 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:11,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:11,833 INFO L82 PathProgramCache]: Analyzing trace with hash 997281865, now seen corresponding path program 1 times [2019-11-16 00:27:11,834 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:11,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270854450] [2019-11-16 00:27:11,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:11,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:11,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:12,043 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-11-16 00:27:12,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270854450] [2019-11-16 00:27:12,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:12,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:27:12,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463635622] [2019-11-16 00:27:12,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:12,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:12,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:12,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:12,046 INFO L87 Difference]: Start difference. First operand 1838 states and 2217 transitions. Second operand 3 states. [2019-11-16 00:27:12,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:12,557 INFO L93 Difference]: Finished difference Result 2364 states and 2826 transitions. [2019-11-16 00:27:12,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:12,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-11-16 00:27:12,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:12,571 INFO L225 Difference]: With dead ends: 2364 [2019-11-16 00:27:12,571 INFO L226 Difference]: Without dead ends: 2362 [2019-11-16 00:27:12,572 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:12,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-11-16 00:27:12,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1707. [2019-11-16 00:27:12,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-16 00:27:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2043 transitions. [2019-11-16 00:27:12,646 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2043 transitions. Word has length 198 [2019-11-16 00:27:12,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:12,647 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2043 transitions. [2019-11-16 00:27:12,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:12,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2043 transitions. [2019-11-16 00:27:12,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-16 00:27:12,652 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:12,653 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2019-11-16 00:27:12,653 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:12,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:12,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1286042342, now seen corresponding path program 1 times [2019-11-16 00:27:12,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:12,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980767534] [2019-11-16 00:27:12,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:12,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:12,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 141 proven. 70 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-16 00:27:12,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980767534] [2019-11-16 00:27:12,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209496202] [2019-11-16 00:27:12,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ca18cef0-95ff-4dfd-b63d-605d051575ff/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-16 00:27:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:13,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:27:13,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-16 00:27:13,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:27:13,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-16 00:27:13,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661976558] [2019-11-16 00:27:13,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:13,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:13,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:13,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:27:13,118 INFO L87 Difference]: Start difference. First operand 1707 states and 2043 transitions. Second operand 3 states. [2019-11-16 00:27:13,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:13,745 INFO L93 Difference]: Finished difference Result 3410 states and 4083 transitions. [2019-11-16 00:27:13,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:13,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-16 00:27:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:13,746 INFO L225 Difference]: With dead ends: 3410 [2019-11-16 00:27:13,746 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:27:13,750 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 218 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:27:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:27:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:27:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:27:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:27:13,751 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 216 [2019-11-16 00:27:13,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:13,752 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:27:13,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:13,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:27:13,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:27:13,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:13,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:27:14,373 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2019-11-16 00:27:14,613 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2019-11-16 00:27:14,615 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-16 00:27:14,615 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-16 00:27:14,615 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,615 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,615 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,615 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,616 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,616 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,616 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-16 00:27:14,616 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-16 00:27:14,616 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-16 00:27:14,616 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-16 00:27:14,616 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-16 00:27:14,616 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-16 00:27:14,616 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-16 00:27:14,616 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-16 00:27:14,617 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-16 00:27:14,617 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-16 00:27:14,617 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,617 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,617 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,617 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,617 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,617 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,617 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-16 00:27:14,617 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-16 00:27:14,618 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-16 00:27:14,618 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-16 00:27:14,618 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-16 00:27:14,618 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-16 00:27:14,618 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-16 00:27:14,618 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-16 00:27:14,618 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-16 00:27:14,618 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-16 00:27:14,618 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-16 00:27:14,618 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-16 00:27:14,618 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-16 00:27:14,619 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-16 00:27:14,619 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-16 00:27:14,619 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,619 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,619 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,619 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,619 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,619 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-16 00:27:14,619 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-16 00:27:14,619 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-16 00:27:14,620 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-16 00:27:14,620 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-16 00:27:14,620 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-16 00:27:14,620 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-16 00:27:14,620 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-16 00:27:14,620 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-16 00:27:14,621 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse3 (= ~a17~0 1)) (.cse0 (not (= ~a8~0 13))) (.cse6 (not (= ~a16~0 6))) (.cse5 (<= ~a21~0 0)) (.cse1 (not (= ~a7~0 1))) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse5 .cse6 .cse3) (and .cse0 .cse6 .cse2) (and .cse1 .cse6 .cse2) (and .cse5 .cse4) (and .cse1 .cse2 .cse4))) [2019-11-16 00:27:14,621 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,621 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,621 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,621 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,621 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,621 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-16 00:27:14,621 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-16 00:27:14,621 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-16 00:27:14,625 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-16 00:27:14,625 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-16 00:27:14,625 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-16 00:27:14,625 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-16 00:27:14,625 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-16 00:27:14,625 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-16 00:27:14,626 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-16 00:27:14,626 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 458) no Hoare annotation was computed. [2019-11-16 00:27:14,626 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-16 00:27:14,626 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-16 00:27:14,626 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-16 00:27:14,626 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-16 00:27:14,626 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,626 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,626 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,627 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,627 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,627 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-16 00:27:14,627 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-16 00:27:14,627 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-16 00:27:14,627 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-16 00:27:14,627 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-16 00:27:14,627 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-16 00:27:14,627 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-16 00:27:14,627 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-16 00:27:14,628 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-16 00:27:14,628 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,628 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,628 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,628 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,628 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-16 00:27:14,628 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,628 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-16 00:27:14,628 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-16 00:27:14,629 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-16 00:27:14,629 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-16 00:27:14,629 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-16 00:27:14,629 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-16 00:27:14,629 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-16 00:27:14,629 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:27:14,629 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-16 00:27:14,630 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-16 00:27:14,630 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-16 00:27:14,630 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-16 00:27:14,631 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-16 00:27:14,631 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-16 00:27:14,632 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,632 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (= ~a17~0 1)) (.cse0 (not (= ~a8~0 13))) (.cse6 (not (= ~a16~0 6))) (.cse5 (<= ~a21~0 0)) (.cse1 (not (= ~a7~0 1))) (.cse2 (= ~a21~0 1)) (.cse4 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse5 .cse6 .cse3) (and .cse0 .cse6 .cse2) (and .cse1 .cse6 .cse2) (and .cse5 .cse4) (and .cse1 .cse2 .cse4))) [2019-11-16 00:27:14,632 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,633 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,633 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,633 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,633 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-16 00:27:14,633 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-16 00:27:14,633 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-16 00:27:14,633 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-16 00:27:14,634 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-16 00:27:14,634 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-16 00:27:14,634 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-16 00:27:14,634 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-16 00:27:14,634 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,634 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,634 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,635 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,635 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,635 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-16 00:27:14,635 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:27:14,635 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-16 00:27:14,635 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-16 00:27:14,635 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-16 00:27:14,636 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-16 00:27:14,636 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-16 00:27:14,636 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-16 00:27:14,636 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-16 00:27:14,636 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-16 00:27:14,636 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-16 00:27:14,636 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-16 00:27:14,637 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-16 00:27:14,637 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,637 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,637 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,637 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,637 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-16 00:27:14,637 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,638 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,638 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-16 00:27:14,638 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-16 00:27:14,638 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:27:14,638 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-16 00:27:14,638 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-16 00:27:14,638 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-16 00:27:14,639 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-16 00:27:14,639 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-16 00:27:14,639 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-16 00:27:14,639 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-16 00:27:14,639 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-16 00:27:14,639 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-16 00:27:14,639 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-16 00:27:14,640 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,640 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,640 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,640 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,640 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,640 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-16 00:27:14,640 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,641 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-16 00:27:14,641 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-16 00:27:14,641 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-16 00:27:14,641 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-16 00:27:14,641 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-16 00:27:14,641 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-16 00:27:14,642 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-16 00:27:14,642 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-16 00:27:14,642 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-16 00:27:14,642 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-16 00:27:14,642 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-16 00:27:14,642 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:27:14,642 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-16 00:27:14,643 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-16 00:27:14,643 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-16 00:27:14,643 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,643 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,643 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,643 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,643 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,644 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:27:14,644 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-16 00:27:14,644 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-16 00:27:14,644 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-16 00:27:14,644 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-16 00:27:14,644 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-16 00:27:14,644 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-16 00:27:14,645 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-16 00:27:14,645 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-16 00:27:14,645 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-16 00:27:14,645 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-16 00:27:14,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:27:14 BoogieIcfgContainer [2019-11-16 00:27:14,677 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:27:14,678 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:27:14,678 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:27:14,678 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:27:14,679 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:27:02" (3/4) ... [2019-11-16 00:27:14,682 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:27:14,718 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:27:14,720 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:27:14,907 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ca18cef0-95ff-4dfd-b63d-605d051575ff/bin/uautomizer/witness.graphml [2019-11-16 00:27:14,907 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:27:14,909 INFO L168 Benchmark]: Toolchain (without parser) took 14367.45 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 274.7 MB). Free memory was 943.4 MB in the beginning and 855.5 MB in the end (delta: 87.9 MB). Peak memory consumption was 362.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:14,909 INFO L168 Benchmark]: CDTParser took 0.20 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-16 00:27:14,909 INFO L168 Benchmark]: CACSL2BoogieTranslator took 644.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:14,910 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:14,910 INFO L168 Benchmark]: Boogie Preprocessor took 98.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:27:14,910 INFO L168 Benchmark]: RCFGBuilder took 1233.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.2 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:14,911 INFO L168 Benchmark]: TraceAbstraction took 12041.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 134.2 MB). Free memory was 992.2 MB in the beginning and 875.1 MB in the end (delta: 117.1 MB). Peak memory consumption was 251.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:14,911 INFO L168 Benchmark]: Witness Printer took 229.18 ms. Allocated memory is still 1.3 GB. Free memory was 875.1 MB in the beginning and 855.5 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:14,914 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.20 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 644.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1233.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.2 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12041.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 134.2 MB). Free memory was 992.2 MB in the beginning and 875.1 MB in the end (delta: 117.1 MB). Peak memory consumption was 251.3 MB. Max. memory is 11.5 GB. * Witness Printer took 229.18 ms. Allocated memory is still 1.3 GB. Free memory was 875.1 MB in the beginning and 855.5 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 458]: 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: (((((((!(a8 == 13) && !(a7 == 1)) && a21 == 1) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((a21 <= 0 && !(a16 == 6)) && a17 == 1)) || ((!(a8 == 13) && !(a16 == 6)) && a21 == 1)) || ((!(a7 == 1) && !(a16 == 6)) && a21 == 1)) || (a21 <= 0 && a20 == 1)) || ((!(a7 == 1) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((!(a8 == 13) && !(a7 == 1)) && a21 == 1) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((a21 <= 0 && !(a16 == 6)) && a17 == 1)) || ((!(a8 == 13) && !(a16 == 6)) && a21 == 1)) || ((!(a7 == 1) && !(a16 == 6)) && a21 == 1)) || (a21 <= 0 && a20 == 1)) || ((!(a7 == 1) && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 11.9s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 559 SDtfs, 1803 SDslu, 80 SDs, 0 SdLazy, 4248 SolverSat, 907 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 228 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 1611 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 32 NumberOfFragments, 153 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3106 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 462 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1720 NumberOfCodeBlocks, 1720 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1709 ConstructedInterpolants, 0 QuantifiedInterpolants, 712697 SizeOfPredicates, 1 NumberOfNonLiveVariables, 389 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 1003/1073 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...