./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ca6a8000-7482-4098-8477-ef2095ecf46d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ca6a8000-7482-4098-8477-ef2095ecf46d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ca6a8000-7482-4098-8477-ef2095ecf46d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ca6a8000-7482-4098-8477-ef2095ecf46d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label19.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ca6a8000-7482-4098-8477-ef2095ecf46d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ca6a8000-7482-4098-8477-ef2095ecf46d/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 1dbe756481135ac1d54a76a4eed07fd2745a9deb .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 09:41:25,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 09:41:25,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 09:41:25,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 09:41:25,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 09:41:25,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 09:41:25,376 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 09:41:25,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 09:41:25,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 09:41:25,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 09:41:25,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 09:41:25,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 09:41:25,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 09:41:25,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 09:41:25,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 09:41:25,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 09:41:25,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 09:41:25,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 09:41:25,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 09:41:25,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 09:41:25,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 09:41:25,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 09:41:25,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 09:41:25,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 09:41:25,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 09:41:25,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 09:41:25,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 09:41:25,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 09:41:25,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 09:41:25,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 09:41:25,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 09:41:25,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 09:41:25,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 09:41:25,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 09:41:25,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 09:41:25,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 09:41:25,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 09:41:25,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 09:41:25,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 09:41:25,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 09:41:25,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 09:41:25,429 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ca6a8000-7482-4098-8477-ef2095ecf46d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 09:41:25,454 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 09:41:25,455 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 09:41:25,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 09:41:25,456 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 09:41:25,456 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 09:41:25,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 09:41:25,457 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 09:41:25,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 09:41:25,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 09:41:25,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 09:41:25,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 09:41:25,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 09:41:25,459 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 09:41:25,459 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 09:41:25,459 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 09:41:25,460 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 09:41:25,460 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 09:41:25,460 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 09:41:25,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 09:41:25,460 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 09:41:25,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 09:41:25,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 09:41:25,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 09:41:25,461 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 09:41:25,462 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 09:41:25,462 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 09:41:25,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 09:41:25,462 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 09:41:25,462 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_ca6a8000-7482-4098-8477-ef2095ecf46d/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 -> 1dbe756481135ac1d54a76a4eed07fd2745a9deb [2019-11-20 09:41:25,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 09:41:25,640 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 09:41:25,643 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 09:41:25,644 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 09:41:25,645 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 09:41:25,645 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ca6a8000-7482-4098-8477-ef2095ecf46d/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label19.c [2019-11-20 09:41:25,704 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ca6a8000-7482-4098-8477-ef2095ecf46d/bin/uautomizer/data/7cb77a0b0/6d0f48cf5d5a43b49e6d75b17d2f9e38/FLAG8e7ddfadd [2019-11-20 09:41:26,166 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 09:41:26,166 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ca6a8000-7482-4098-8477-ef2095ecf46d/sv-benchmarks/c/eca-rers2012/Problem01_label19.c [2019-11-20 09:41:26,180 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ca6a8000-7482-4098-8477-ef2095ecf46d/bin/uautomizer/data/7cb77a0b0/6d0f48cf5d5a43b49e6d75b17d2f9e38/FLAG8e7ddfadd [2019-11-20 09:41:26,495 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ca6a8000-7482-4098-8477-ef2095ecf46d/bin/uautomizer/data/7cb77a0b0/6d0f48cf5d5a43b49e6d75b17d2f9e38 [2019-11-20 09:41:26,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 09:41:26,499 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 09:41:26,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 09:41:26,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 09:41:26,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 09:41:26,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:41:26" (1/1) ... [2019-11-20 09:41:26,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f29b82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:26, skipping insertion in model container [2019-11-20 09:41:26,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:41:26" (1/1) ... [2019-11-20 09:41:26,512 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 09:41:26,554 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 09:41:26,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:41:26,958 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 09:41:27,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:41:27,088 INFO L192 MainTranslator]: Completed translation [2019-11-20 09:41:27,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:27 WrapperNode [2019-11-20 09:41:27,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 09:41:27,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 09:41:27,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 09:41:27,090 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 09:41:27,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:27" (1/1) ... [2019-11-20 09:41:27,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:27" (1/1) ... [2019-11-20 09:41:27,174 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 09:41:27,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 09:41:27,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 09:41:27,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 09:41:27,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:27" (1/1) ... [2019-11-20 09:41:27,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:27" (1/1) ... [2019-11-20 09:41:27,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:27" (1/1) ... [2019-11-20 09:41:27,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:27" (1/1) ... [2019-11-20 09:41:27,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:27" (1/1) ... [2019-11-20 09:41:27,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:27" (1/1) ... [2019-11-20 09:41:27,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:27" (1/1) ... [2019-11-20 09:41:27,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 09:41:27,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 09:41:27,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 09:41:27,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 09:41:27,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ca6a8000-7482-4098-8477-ef2095ecf46d/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-20 09:41:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 09:41:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 09:41:28,542 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 09:41:28,542 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 09:41:28,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:41:28 BoogieIcfgContainer [2019-11-20 09:41:28,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 09:41:28,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 09:41:28,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 09:41:28,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 09:41:28,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:41:26" (1/3) ... [2019-11-20 09:41:28,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611a5da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:41:28, skipping insertion in model container [2019-11-20 09:41:28,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:27" (2/3) ... [2019-11-20 09:41:28,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611a5da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:41:28, skipping insertion in model container [2019-11-20 09:41:28,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:41:28" (3/3) ... [2019-11-20 09:41:28,554 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label19.c [2019-11-20 09:41:28,563 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 09:41:28,570 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 09:41:28,580 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 09:41:28,616 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 09:41:28,616 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 09:41:28,616 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 09:41:28,616 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 09:41:28,616 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 09:41:28,616 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 09:41:28,616 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 09:41:28,617 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 09:41:28,638 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-20 09:41:28,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 09:41:28,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:41:28,650 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:41:28,651 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:41:28,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:41:28,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1118209127, now seen corresponding path program 1 times [2019-11-20 09:41:28,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:41:28,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662888954] [2019-11-20 09:41:28,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:41:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:29,051 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-20 09:41:29,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662888954] [2019-11-20 09:41:29,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:41:29,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 09:41:29,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592171421] [2019-11-20 09:41:29,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:41:29,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:41:29,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:41:29,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:41:29,074 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-20 09:41:30,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:41:30,522 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-20 09:41:30,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:41:30,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-20 09:41:30,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:41:30,539 INFO L225 Difference]: With dead ends: 662 [2019-11-20 09:41:30,539 INFO L226 Difference]: Without dead ends: 397 [2019-11-20 09:41:30,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:41:30,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-20 09:41:30,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-20 09:41:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-20 09:41:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2019-11-20 09:41:30,605 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 86 [2019-11-20 09:41:30,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:41:30,605 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2019-11-20 09:41:30,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:41:30,606 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2019-11-20 09:41:30,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 09:41:30,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:41:30,610 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:41:30,610 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:41:30,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:41:30,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1535713217, now seen corresponding path program 1 times [2019-11-20 09:41:30,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:41:30,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438761568] [2019-11-20 09:41:30,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:41:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:41:30,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438761568] [2019-11-20 09:41:30,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:41:30,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 09:41:30,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909166788] [2019-11-20 09:41:30,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:41:30,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:41:30,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:41:30,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:41:30,681 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand 4 states. [2019-11-20 09:41:31,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:41:31,297 INFO L93 Difference]: Finished difference Result 1185 states and 1672 transitions. [2019-11-20 09:41:31,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:41:31,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-20 09:41:31,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:41:31,304 INFO L225 Difference]: With dead ends: 1185 [2019-11-20 09:41:31,304 INFO L226 Difference]: Without dead ends: 790 [2019-11-20 09:41:31,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:41:31,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-20 09:41:31,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-20 09:41:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-20 09:41:31,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-11-20 09:41:31,380 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 91 [2019-11-20 09:41:31,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:41:31,382 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-11-20 09:41:31,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:41:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-11-20 09:41:31,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-20 09:41:31,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:41:31,393 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:41:31,393 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:41:31,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:41:31,394 INFO L82 PathProgramCache]: Analyzing trace with hash -391670679, now seen corresponding path program 1 times [2019-11-20 09:41:31,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:41:31,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784765908] [2019-11-20 09:41:31,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:41:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 09:41:31,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784765908] [2019-11-20 09:41:31,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:41:31,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 09:41:31,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656007308] [2019-11-20 09:41:31,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:41:31,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:41:31,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:41:31,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:41:31,475 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-11-20 09:41:32,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:41:32,003 INFO L93 Difference]: Finished difference Result 1971 states and 2686 transitions. [2019-11-20 09:41:32,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:41:32,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-20 09:41:32,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:41:32,010 INFO L225 Difference]: With dead ends: 1971 [2019-11-20 09:41:32,011 INFO L226 Difference]: Without dead ends: 1183 [2019-11-20 09:41:32,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:41:32,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-11-20 09:41:32,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 921. [2019-11-20 09:41:32,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-20 09:41:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1246 transitions. [2019-11-20 09:41:32,054 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1246 transitions. Word has length 112 [2019-11-20 09:41:32,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:41:32,054 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1246 transitions. [2019-11-20 09:41:32,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:41:32,055 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1246 transitions. [2019-11-20 09:41:32,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 09:41:32,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:41:32,070 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:41:32,070 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:41:32,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:41:32,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1405764788, now seen corresponding path program 1 times [2019-11-20 09:41:32,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:41:32,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333179492] [2019-11-20 09:41:32,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:41:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:32,200 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-20 09:41:32,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333179492] [2019-11-20 09:41:32,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:41:32,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 09:41:32,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009803422] [2019-11-20 09:41:32,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:41:32,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:41:32,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:41:32,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:41:32,204 INFO L87 Difference]: Start difference. First operand 921 states and 1246 transitions. Second operand 3 states. [2019-11-20 09:41:32,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:41:32,702 INFO L93 Difference]: Finished difference Result 2233 states and 2997 transitions. [2019-11-20 09:41:32,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:41:32,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-20 09:41:32,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:41:32,711 INFO L225 Difference]: With dead ends: 2233 [2019-11-20 09:41:32,711 INFO L226 Difference]: Without dead ends: 1314 [2019-11-20 09:41:32,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:41:32,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-20 09:41:32,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1052. [2019-11-20 09:41:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-11-20 09:41:32,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1358 transitions. [2019-11-20 09:41:32,743 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1358 transitions. Word has length 148 [2019-11-20 09:41:32,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:41:32,744 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1358 transitions. [2019-11-20 09:41:32,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:41:32,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1358 transitions. [2019-11-20 09:41:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-20 09:41:32,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:41:32,748 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:41:32,748 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:41:32,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:41:32,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1778218692, now seen corresponding path program 1 times [2019-11-20 09:41:32,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:41:32,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746697211] [2019-11-20 09:41:32,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:41:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-20 09:41:32,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746697211] [2019-11-20 09:41:32,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:41:32,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 09:41:32,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133495007] [2019-11-20 09:41:32,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:41:32,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:41:32,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:41:32,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:41:32,853 INFO L87 Difference]: Start difference. First operand 1052 states and 1358 transitions. Second operand 3 states. [2019-11-20 09:41:33,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:41:33,422 INFO L93 Difference]: Finished difference Result 2888 states and 3704 transitions. [2019-11-20 09:41:33,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:41:33,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-20 09:41:33,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:41:33,435 INFO L225 Difference]: With dead ends: 2888 [2019-11-20 09:41:33,435 INFO L226 Difference]: Without dead ends: 1838 [2019-11-20 09:41:33,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:41:33,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-20 09:41:33,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1576. [2019-11-20 09:41:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-20 09:41:33,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1990 transitions. [2019-11-20 09:41:33,487 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1990 transitions. Word has length 167 [2019-11-20 09:41:33,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:41:33,489 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1990 transitions. [2019-11-20 09:41:33,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:41:33,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1990 transitions. [2019-11-20 09:41:33,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 09:41:33,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:41:33,494 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:41:33,495 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:41:33,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:41:33,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1346782237, now seen corresponding path program 1 times [2019-11-20 09:41:33,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:41:33,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247742269] [2019-11-20 09:41:33,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:41:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-20 09:41:33,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247742269] [2019-11-20 09:41:33,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:41:33,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 09:41:33,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114148284] [2019-11-20 09:41:33,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:41:33,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:41:33,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:41:33,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:41:33,582 INFO L87 Difference]: Start difference. First operand 1576 states and 1990 transitions. Second operand 3 states. [2019-11-20 09:41:34,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:41:34,146 INFO L93 Difference]: Finished difference Result 3412 states and 4294 transitions. [2019-11-20 09:41:34,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:41:34,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-11-20 09:41:34,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:41:34,158 INFO L225 Difference]: With dead ends: 3412 [2019-11-20 09:41:34,158 INFO L226 Difference]: Without dead ends: 1838 [2019-11-20 09:41:34,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:41:34,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-20 09:41:34,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-20 09:41:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-20 09:41:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2270 transitions. [2019-11-20 09:41:34,210 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2270 transitions. Word has length 170 [2019-11-20 09:41:34,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:41:34,212 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2270 transitions. [2019-11-20 09:41:34,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:41:34,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2270 transitions. [2019-11-20 09:41:34,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 09:41:34,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:41:34,217 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 09:41:34,217 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:41:34,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:41:34,222 INFO L82 PathProgramCache]: Analyzing trace with hash 566709275, now seen corresponding path program 1 times [2019-11-20 09:41:34,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:41:34,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528217483] [2019-11-20 09:41:34,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:41:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-20 09:41:34,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528217483] [2019-11-20 09:41:34,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:41:34,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 09:41:34,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514041785] [2019-11-20 09:41:34,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 09:41:34,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:41:34,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 09:41:34,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 09:41:34,475 INFO L87 Difference]: Start difference. First operand 1838 states and 2270 transitions. Second operand 8 states. [2019-11-20 09:41:35,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:41:35,619 INFO L93 Difference]: Finished difference Result 3841 states and 4711 transitions. [2019-11-20 09:41:35,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 09:41:35,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 174 [2019-11-20 09:41:35,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:41:35,630 INFO L225 Difference]: With dead ends: 3841 [2019-11-20 09:41:35,630 INFO L226 Difference]: Without dead ends: 2005 [2019-11-20 09:41:35,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 09:41:35,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2019-11-20 09:41:35,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1838. [2019-11-20 09:41:35,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-20 09:41:35,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2258 transitions. [2019-11-20 09:41:35,677 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2258 transitions. Word has length 174 [2019-11-20 09:41:35,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:41:35,677 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2258 transitions. [2019-11-20 09:41:35,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 09:41:35,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2258 transitions. [2019-11-20 09:41:35,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-20 09:41:35,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:41:35,683 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:41:35,683 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:41:35,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:41:35,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1728189589, now seen corresponding path program 1 times [2019-11-20 09:41:35,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:41:35,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497162478] [2019-11-20 09:41:35,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:41:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-20 09:41:35,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497162478] [2019-11-20 09:41:35,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:41:35,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:41:35,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905197451] [2019-11-20 09:41:35,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:41:35,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:41:35,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:41:35,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:41:35,832 INFO L87 Difference]: Start difference. First operand 1838 states and 2258 transitions. Second operand 4 states. [2019-11-20 09:41:36,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:41:36,668 INFO L93 Difference]: Finished difference Result 3936 states and 4836 transitions. [2019-11-20 09:41:36,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:41:36,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2019-11-20 09:41:36,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:41:36,677 INFO L225 Difference]: With dead ends: 3936 [2019-11-20 09:41:36,677 INFO L226 Difference]: Without dead ends: 2100 [2019-11-20 09:41:36,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:41:36,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-20 09:41:36,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2019-11-20 09:41:36,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-20 09:41:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2323 transitions. [2019-11-20 09:41:36,721 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2323 transitions. Word has length 207 [2019-11-20 09:41:36,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:41:36,722 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2323 transitions. [2019-11-20 09:41:36,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:41:36,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2323 transitions. [2019-11-20 09:41:36,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-20 09:41:36,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:41:36,729 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 09:41:36,730 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:41:36,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:41:36,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1488900895, now seen corresponding path program 1 times [2019-11-20 09:41:36,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:41:36,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822289606] [2019-11-20 09:41:36,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:41:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:36,956 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-20 09:41:36,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822289606] [2019-11-20 09:41:36,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:41:36,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:41:36,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291280226] [2019-11-20 09:41:36,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:41:36,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:41:36,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:41:36,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:41:36,963 INFO L87 Difference]: Start difference. First operand 1969 states and 2323 transitions. Second operand 4 states. [2019-11-20 09:41:37,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:41:37,693 INFO L93 Difference]: Finished difference Result 4460 states and 5222 transitions. [2019-11-20 09:41:37,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:41:37,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2019-11-20 09:41:37,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:41:37,707 INFO L225 Difference]: With dead ends: 4460 [2019-11-20 09:41:37,707 INFO L226 Difference]: Without dead ends: 2493 [2019-11-20 09:41:37,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:41:37,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2019-11-20 09:41:37,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 1969. [2019-11-20 09:41:37,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-20 09:41:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2311 transitions. [2019-11-20 09:41:37,760 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2311 transitions. Word has length 233 [2019-11-20 09:41:37,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:41:37,761 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2311 transitions. [2019-11-20 09:41:37,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:41:37,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2311 transitions. [2019-11-20 09:41:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-11-20 09:41:37,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:41:37,768 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:41:37,768 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:41:37,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:41:37,769 INFO L82 PathProgramCache]: Analyzing trace with hash -408615606, now seen corresponding path program 1 times [2019-11-20 09:41:37,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:41:37,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048733639] [2019-11-20 09:41:37,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:41:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:37,978 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-20 09:41:37,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048733639] [2019-11-20 09:41:37,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:41:37,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 09:41:37,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148430965] [2019-11-20 09:41:37,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 09:41:37,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:41:37,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 09:41:37,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 09:41:37,980 INFO L87 Difference]: Start difference. First operand 1969 states and 2311 transitions. Second operand 6 states. [2019-11-20 09:41:38,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:41:38,982 INFO L93 Difference]: Finished difference Result 4105 states and 4795 transitions. [2019-11-20 09:41:38,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 09:41:38,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 254 [2019-11-20 09:41:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:41:38,997 INFO L225 Difference]: With dead ends: 4105 [2019-11-20 09:41:38,997 INFO L226 Difference]: Without dead ends: 2138 [2019-11-20 09:41:39,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 09:41:39,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2019-11-20 09:41:39,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1838. [2019-11-20 09:41:39,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-20 09:41:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2102 transitions. [2019-11-20 09:41:39,040 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2102 transitions. Word has length 254 [2019-11-20 09:41:39,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:41:39,041 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2102 transitions. [2019-11-20 09:41:39,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 09:41:39,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2102 transitions. [2019-11-20 09:41:39,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-11-20 09:41:39,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:41:39,048 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:41:39,048 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:41:39,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:41:39,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1287995233, now seen corresponding path program 1 times [2019-11-20 09:41:39,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:41:39,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175539167] [2019-11-20 09:41:39,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:41:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 351 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-20 09:41:40,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175539167] [2019-11-20 09:41:40,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631246350] [2019-11-20 09:41:40,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ca6a8000-7482-4098-8477-ef2095ecf46d/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-20 09:41:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:40,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 09:41:40,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:41:40,481 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-11-20 09:41:40,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 09:41:40,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-11-20 09:41:40,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038867914] [2019-11-20 09:41:40,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:41:40,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:41:40,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:41:40,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-11-20 09:41:40,484 INFO L87 Difference]: Start difference. First operand 1838 states and 2102 transitions. Second operand 3 states. [2019-11-20 09:41:41,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:41:41,079 INFO L93 Difference]: Finished difference Result 4065 states and 4618 transitions. [2019-11-20 09:41:41,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:41:41,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 276 [2019-11-20 09:41:41,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:41:41,081 INFO L225 Difference]: With dead ends: 4065 [2019-11-20 09:41:41,081 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 09:41:41,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 280 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-11-20 09:41:41,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 09:41:41,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 09:41:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 09:41:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 09:41:41,086 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 276 [2019-11-20 09:41:41,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:41:41,086 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 09:41:41,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:41:41,086 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 09:41:41,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 09:41:41,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:41:41,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 09:41:41,426 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 76 [2019-11-20 09:41:41,539 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 76 [2019-11-20 09:41:41,985 WARN L191 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 37 [2019-11-20 09:41:42,409 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 37 [2019-11-20 09:41:42,412 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-20 09:41:42,412 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-20 09:41:42,413 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,413 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,413 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,413 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,413 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,413 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,413 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-20 09:41:42,413 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-20 09:41:42,413 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-20 09:41:42,413 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-20 09:41:42,413 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-20 09:41:42,413 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-20 09:41:42,414 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-20 09:41:42,414 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-20 09:41:42,414 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-20 09:41:42,414 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-20 09:41:42,414 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,414 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,414 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,414 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,414 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,414 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,414 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-20 09:41:42,414 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-20 09:41:42,414 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-20 09:41:42,415 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-20 09:41:42,415 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-20 09:41:42,415 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-20 09:41:42,415 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-20 09:41:42,415 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-20 09:41:42,415 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-20 09:41:42,415 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-20 09:41:42,415 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-20 09:41:42,415 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-20 09:41:42,415 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-20 09:41:42,415 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-20 09:41:42,415 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-20 09:41:42,415 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,416 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,416 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,416 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,416 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,416 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-20 09:41:42,416 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-20 09:41:42,416 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-20 09:41:42,416 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-20 09:41:42,416 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-20 09:41:42,416 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-20 09:41:42,416 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-20 09:41:42,416 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-20 09:41:42,416 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-20 09:41:42,417 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse2 (not (= ~a7~0 1))) (.cse3 (= ~a16~0 6)) (.cse5 (= ~a17~0 1)) (.cse0 (= ~a21~0 1)) (.cse1 (= ~a20~0 1)) (.cse6 (<= ~a8~0 13)) (.cse4 (= ~a16~0 4))) (or (and .cse0 (= 5 ~a16~0)) (and (and .cse0 .cse1) .cse2 .cse3) (and .cse2 .cse0 (= 15 ~a8~0) .cse3) (and .cse4 .cse0 (not .cse5)) (and .cse6 .cse3) (and .cse2 (not .cse3) .cse5 .cse0) (and .cse6 .cse5) (and .cse5 .cse0 .cse1) (and .cse6 .cse4 (<= ~a17~0 0)))) [2019-11-20 09:41:42,417 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,417 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,417 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,417 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,417 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,423 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-20 09:41:42,423 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-20 09:41:42,423 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-20 09:41:42,423 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-20 09:41:42,423 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-20 09:41:42,423 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-20 09:41:42,424 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-20 09:41:42,424 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-20 09:41:42,424 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-20 09:41:42,424 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-20 09:41:42,424 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-20 09:41:42,424 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-20 09:41:42,424 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-20 09:41:42,425 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-20 09:41:42,425 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,425 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,425 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,425 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,425 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,425 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-20 09:41:42,426 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-20 09:41:42,426 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-20 09:41:42,426 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-20 09:41:42,426 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-20 09:41:42,426 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-20 09:41:42,426 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-20 09:41:42,426 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-20 09:41:42,427 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-20 09:41:42,427 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,427 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,427 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,427 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,427 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-20 09:41:42,427 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,427 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-20 09:41:42,428 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-20 09:41:42,428 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-20 09:41:42,428 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-20 09:41:42,428 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-20 09:41:42,428 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-20 09:41:42,428 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-20 09:41:42,428 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 09:41:42,429 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-20 09:41:42,429 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-20 09:41:42,429 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-20 09:41:42,429 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-20 09:41:42,429 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-20 09:41:42,429 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-20 09:41:42,429 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,431 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse2 (not (= ~a7~0 1))) (.cse3 (= ~a16~0 6)) (.cse5 (= ~a17~0 1)) (.cse0 (= ~a21~0 1)) (.cse1 (= ~a20~0 1)) (.cse6 (<= ~a8~0 13)) (.cse4 (= ~a16~0 4))) (or (and .cse0 (= 5 ~a16~0)) (and (and .cse0 .cse1) .cse2 .cse3) (and .cse2 .cse0 (= 15 ~a8~0) .cse3) (and .cse4 .cse0 (not .cse5)) (and .cse6 .cse3) (and .cse2 (not .cse3) .cse5 .cse0) (and .cse6 .cse5) (and .cse5 .cse0 .cse1) (and .cse6 .cse4 (<= ~a17~0 0)))) [2019-11-20 09:41:42,431 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,431 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,431 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,431 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,431 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-20 09:41:42,432 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-20 09:41:42,432 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-20 09:41:42,432 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-20 09:41:42,433 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-20 09:41:42,433 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-20 09:41:42,433 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-20 09:41:42,433 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-20 09:41:42,433 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,433 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,433 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,434 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,434 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,434 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-20 09:41:42,434 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 09:41:42,434 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-20 09:41:42,434 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-20 09:41:42,434 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-20 09:41:42,435 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-20 09:41:42,435 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-20 09:41:42,435 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-20 09:41:42,435 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-20 09:41:42,435 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-20 09:41:42,435 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-20 09:41:42,435 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-20 09:41:42,435 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-20 09:41:42,436 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,436 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,436 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,436 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,436 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-20 09:41:42,436 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,436 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,437 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-20 09:41:42,437 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-20 09:41:42,437 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 09:41:42,437 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-20 09:41:42,437 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-20 09:41:42,437 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-20 09:41:42,437 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-20 09:41:42,437 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-20 09:41:42,438 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-20 09:41:42,438 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-20 09:41:42,438 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-20 09:41:42,438 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-20 09:41:42,438 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-20 09:41:42,438 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,438 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,439 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,439 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,439 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,439 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-20 09:41:42,439 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,439 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-20 09:41:42,439 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-20 09:41:42,439 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-20 09:41:42,440 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-20 09:41:42,440 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-20 09:41:42,440 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-20 09:41:42,440 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-20 09:41:42,440 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-20 09:41:42,440 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-20 09:41:42,440 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-20 09:41:42,441 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-20 09:41:42,441 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 09:41:42,441 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 434) no Hoare annotation was computed. [2019-11-20 09:41:42,441 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-20 09:41:42,441 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-20 09:41:42,441 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-20 09:41:42,441 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,442 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,442 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,442 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,442 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,442 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 09:41:42,442 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-20 09:41:42,442 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-20 09:41:42,443 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-20 09:41:42,443 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-20 09:41:42,443 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-20 09:41:42,443 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-20 09:41:42,443 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-20 09:41:42,443 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-20 09:41:42,443 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-20 09:41:42,444 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-20 09:41:42,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:41:42 BoogieIcfgContainer [2019-11-20 09:41:42,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 09:41:42,487 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 09:41:42,488 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 09:41:42,488 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 09:41:42,488 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:41:28" (3/4) ... [2019-11-20 09:41:42,493 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 09:41:42,525 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 09:41:42,526 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 09:41:42,702 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ca6a8000-7482-4098-8477-ef2095ecf46d/bin/uautomizer/witness.graphml [2019-11-20 09:41:42,702 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 09:41:42,704 INFO L168 Benchmark]: Toolchain (without parser) took 16204.39 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 413.7 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -172.0 MB). Peak memory consumption was 241.7 MB. Max. memory is 11.5 GB. [2019-11-20 09:41:42,704 INFO L168 Benchmark]: CDTParser took 0.23 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-20 09:41:42,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 588.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-20 09:41:42,705 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.06 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 09:41:42,705 INFO L168 Benchmark]: Boogie Preprocessor took 84.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 09:41:42,706 INFO L168 Benchmark]: RCFGBuilder took 1283.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 114.6 MB). Peak memory consumption was 114.6 MB. Max. memory is 11.5 GB. [2019-11-20 09:41:42,706 INFO L168 Benchmark]: TraceAbstraction took 13942.21 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 246.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 119.9 MB. Max. memory is 11.5 GB. [2019-11-20 09:41:42,707 INFO L168 Benchmark]: Witness Printer took 215.10 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-11-20 09:41:42,709 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.23 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 588.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.7 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -196.3 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.06 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1283.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 114.6 MB). Peak memory consumption was 114.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13942.21 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 246.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 119.9 MB. Max. memory is 11.5 GB. * Witness Printer took 215.10 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 434]: 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: ((((((((a21 == 1 && 5 == a16) || (((a21 == 1 && a20 == 1) && !(a7 == 1)) && a16 == 6)) || (((!(a7 == 1) && a21 == 1) && 15 == a8) && a16 == 6)) || ((a16 == 4 && a21 == 1) && !(a17 == 1))) || (a8 <= 13 && a16 == 6)) || (((!(a7 == 1) && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (a8 <= 13 && a17 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((a8 <= 13 && a16 == 4) && a17 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((a21 == 1 && 5 == a16) || (((a21 == 1 && a20 == 1) && !(a7 == 1)) && a16 == 6)) || (((!(a7 == 1) && a21 == 1) && 15 == a8) && a16 == 6)) || ((a16 == 4 && a21 == 1) && !(a17 == 1))) || (a8 <= 13 && a16 == 6)) || (((!(a7 == 1) && !(a16 == 6)) && a17 == 1) && a21 == 1)) || (a8 <= 13 && a17 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((a8 <= 13 && a16 == 4) && a17 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 13.8s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, HoareTripleCheckerStatistics: 951 SDtfs, 2266 SDslu, 121 SDs, 0 SdLazy, 5901 SolverSat, 947 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 333 GetRequests, 294 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1908 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 40 NumberOfFragments, 195 HoareAnnotationTreeSize, 3 FomulaSimplifications, 14710 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2158 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 2194 NumberOfCodeBlocks, 2194 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2182 ConstructedInterpolants, 0 QuantifiedInterpolants, 1575022 SizeOfPredicates, 1 NumberOfNonLiveVariables, 507 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2711/2719 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...