./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ef494285-3243-45a2-9ec7-d5ab95d59ba4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ef494285-3243-45a2-9ec7-d5ab95d59ba4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ef494285-3243-45a2-9ec7-d5ab95d59ba4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ef494285-3243-45a2-9ec7-d5ab95d59ba4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label20.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ef494285-3243-45a2-9ec7-d5ab95d59ba4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ef494285-3243-45a2-9ec7-d5ab95d59ba4/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 1298ff218b6f9541d254a77a84b43c082f723276 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:43:20,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:43:20,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:43:20,517 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:43:20,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:43:20,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:43:20,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:43:20,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:43:20,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:43:20,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:43:20,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:43:20,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:43:20,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:43:20,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:43:20,528 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:43:20,529 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:43:20,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:43:20,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:43:20,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:43:20,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:43:20,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:43:20,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:43:20,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:43:20,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:43:20,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:43:20,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:43:20,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:43:20,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:43:20,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:43:20,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:43:20,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:43:20,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:43:20,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:43:20,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:43:20,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:43:20,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:43:20,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:43:20,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:43:20,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:43:20,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:43:20,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:43:20,548 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ef494285-3243-45a2-9ec7-d5ab95d59ba4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:43:20,561 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:43:20,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:43:20,562 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:43:20,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:43:20,563 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:43:20,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:43:20,563 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:43:20,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:43:20,564 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:43:20,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:43:20,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:43:20,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:43:20,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:43:20,565 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:43:20,565 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:43:20,565 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:43:20,565 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:43:20,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:43:20,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:43:20,566 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:43:20,566 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:43:20,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:43:20,567 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:43:20,567 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:43:20,567 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:43:20,568 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:43:20,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:43:20,568 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:43:20,568 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_ef494285-3243-45a2-9ec7-d5ab95d59ba4/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 -> 1298ff218b6f9541d254a77a84b43c082f723276 [2019-11-15 22:43:20,593 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:43:20,602 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:43:20,605 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:43:20,606 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:43:20,607 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:43:20,607 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ef494285-3243-45a2-9ec7-d5ab95d59ba4/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label20.c [2019-11-15 22:43:20,655 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ef494285-3243-45a2-9ec7-d5ab95d59ba4/bin/uautomizer/data/3ef2cdbee/a8d17ee5dbcb45d883d497a07ab1d2e4/FLAGa29a0b93b [2019-11-15 22:43:21,250 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:43:21,251 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ef494285-3243-45a2-9ec7-d5ab95d59ba4/sv-benchmarks/c/eca-rers2012/Problem15_label20.c [2019-11-15 22:43:21,270 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ef494285-3243-45a2-9ec7-d5ab95d59ba4/bin/uautomizer/data/3ef2cdbee/a8d17ee5dbcb45d883d497a07ab1d2e4/FLAGa29a0b93b [2019-11-15 22:43:21,448 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ef494285-3243-45a2-9ec7-d5ab95d59ba4/bin/uautomizer/data/3ef2cdbee/a8d17ee5dbcb45d883d497a07ab1d2e4 [2019-11-15 22:43:21,450 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:43:21,452 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:43:21,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:43:21,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:43:21,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:43:21,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:43:21" (1/1) ... [2019-11-15 22:43:21,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ece4807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:21, skipping insertion in model container [2019-11-15 22:43:21,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:43:21" (1/1) ... [2019-11-15 22:43:21,466 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:43:21,555 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:43:22,337 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:43:22,342 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:43:22,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:43:22,724 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:43:22,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:22 WrapperNode [2019-11-15 22:43:22,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:43:22,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:43:22,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:43:22,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:43:22,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:22" (1/1) ... [2019-11-15 22:43:22,776 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:22" (1/1) ... [2019-11-15 22:43:22,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:43:22,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:43:22,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:43:22,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:43:22,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:22" (1/1) ... [2019-11-15 22:43:22,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:22" (1/1) ... [2019-11-15 22:43:22,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:22" (1/1) ... [2019-11-15 22:43:22,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:22" (1/1) ... [2019-11-15 22:43:23,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:22" (1/1) ... [2019-11-15 22:43:23,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:22" (1/1) ... [2019-11-15 22:43:23,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:22" (1/1) ... [2019-11-15 22:43:23,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:43:23,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:43:23,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:43:23,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:43:23,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef494285-3243-45a2-9ec7-d5ab95d59ba4/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-15 22:43:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:43:23,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:43:26,009 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:43:26,009 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 22:43:26,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:43:26 BoogieIcfgContainer [2019-11-15 22:43:26,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:43:26,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:43:26,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:43:26,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:43:26,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:43:21" (1/3) ... [2019-11-15 22:43:26,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17369e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:43:26, skipping insertion in model container [2019-11-15 22:43:26,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:43:22" (2/3) ... [2019-11-15 22:43:26,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17369e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:43:26, skipping insertion in model container [2019-11-15 22:43:26,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:43:26" (3/3) ... [2019-11-15 22:43:26,018 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label20.c [2019-11-15 22:43:26,029 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:43:26,037 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:43:26,047 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:43:26,083 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:43:26,084 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:43:26,084 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:43:26,084 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:43:26,084 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:43:26,084 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:43:26,084 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:43:26,085 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:43:26,113 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-15 22:43:26,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 22:43:26,121 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:26,122 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:43:26,124 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:26,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:26,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1824112922, now seen corresponding path program 1 times [2019-11-15 22:43:26,136 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:26,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568561232] [2019-11-15 22:43:26,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:26,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:26,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:26,412 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-15 22:43:26,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568561232] [2019-11-15 22:43:26,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:26,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:26,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866711658] [2019-11-15 22:43:26,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:26,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:26,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:26,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:26,433 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-15 22:43:30,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:30,665 INFO L93 Difference]: Finished difference Result 1466 states and 2715 transitions. [2019-11-15 22:43:30,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:30,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-15 22:43:30,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:30,688 INFO L225 Difference]: With dead ends: 1466 [2019-11-15 22:43:30,688 INFO L226 Difference]: Without dead ends: 974 [2019-11-15 22:43:30,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:30,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-11-15 22:43:30,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 972. [2019-11-15 22:43:30,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-11-15 22:43:30,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1407 transitions. [2019-11-15 22:43:30,831 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1407 transitions. Word has length 42 [2019-11-15 22:43:30,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:30,832 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 1407 transitions. [2019-11-15 22:43:30,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:30,832 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1407 transitions. [2019-11-15 22:43:30,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-15 22:43:30,836 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:30,837 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-15 22:43:30,837 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:30,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:30,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1233355541, now seen corresponding path program 1 times [2019-11-15 22:43:30,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:30,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333994872] [2019-11-15 22:43:30,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:30,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:30,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:43:31,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333994872] [2019-11-15 22:43:31,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:31,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:31,142 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659463077] [2019-11-15 22:43:31,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:43:31,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:31,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:43:31,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:31,145 INFO L87 Difference]: Start difference. First operand 972 states and 1407 transitions. Second operand 5 states. [2019-11-15 22:43:35,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:35,228 INFO L93 Difference]: Finished difference Result 3160 states and 4506 transitions. [2019-11-15 22:43:35,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:35,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-11-15 22:43:35,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:35,257 INFO L225 Difference]: With dead ends: 3160 [2019-11-15 22:43:35,257 INFO L226 Difference]: Without dead ends: 2190 [2019-11-15 22:43:35,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:35,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2019-11-15 22:43:35,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 1883. [2019-11-15 22:43:35,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1883 states. [2019-11-15 22:43:35,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 2529 transitions. [2019-11-15 22:43:35,314 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 2529 transitions. Word has length 107 [2019-11-15 22:43:35,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:35,316 INFO L462 AbstractCegarLoop]: Abstraction has 1883 states and 2529 transitions. [2019-11-15 22:43:35,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:43:35,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2529 transitions. [2019-11-15 22:43:35,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-15 22:43:35,325 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:35,325 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:43:35,326 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:35,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:35,326 INFO L82 PathProgramCache]: Analyzing trace with hash 443347812, now seen corresponding path program 1 times [2019-11-15 22:43:35,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:35,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831047014] [2019-11-15 22:43:35,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:35,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:35,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:35,512 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:43:35,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831047014] [2019-11-15 22:43:35,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:35,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:43:35,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964089450] [2019-11-15 22:43:35,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:35,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:35,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:35,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:35,520 INFO L87 Difference]: Start difference. First operand 1883 states and 2529 transitions. Second operand 4 states. [2019-11-15 22:43:40,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:40,491 INFO L93 Difference]: Finished difference Result 7063 states and 9570 transitions. [2019-11-15 22:43:40,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:40,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-11-15 22:43:40,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:40,520 INFO L225 Difference]: With dead ends: 7063 [2019-11-15 22:43:40,520 INFO L226 Difference]: Without dead ends: 5182 [2019-11-15 22:43:40,523 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:40,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5182 states. [2019-11-15 22:43:40,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5182 to 4877. [2019-11-15 22:43:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4877 states. [2019-11-15 22:43:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4877 states to 4877 states and 6150 transitions. [2019-11-15 22:43:40,617 INFO L78 Accepts]: Start accepts. Automaton has 4877 states and 6150 transitions. Word has length 112 [2019-11-15 22:43:40,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:40,618 INFO L462 AbstractCegarLoop]: Abstraction has 4877 states and 6150 transitions. [2019-11-15 22:43:40,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:40,618 INFO L276 IsEmpty]: Start isEmpty. Operand 4877 states and 6150 transitions. [2019-11-15 22:43:40,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-15 22:43:40,619 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:40,619 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:43:40,620 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:40,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:40,620 INFO L82 PathProgramCache]: Analyzing trace with hash 112945190, now seen corresponding path program 1 times [2019-11-15 22:43:40,620 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:40,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824750581] [2019-11-15 22:43:40,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:40,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:40,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:40,742 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:43:40,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824750581] [2019-11-15 22:43:40,742 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:40,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:40,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291910055] [2019-11-15 22:43:40,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:43:40,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:40,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:43:40,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:40,744 INFO L87 Difference]: Start difference. First operand 4877 states and 6150 transitions. Second operand 5 states. [2019-11-15 22:43:44,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:44,607 INFO L93 Difference]: Finished difference Result 13677 states and 17685 transitions. [2019-11-15 22:43:44,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:43:44,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-11-15 22:43:44,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:44,651 INFO L225 Difference]: With dead ends: 13677 [2019-11-15 22:43:44,651 INFO L226 Difference]: Without dead ends: 8802 [2019-11-15 22:43:44,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:44,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8802 states. [2019-11-15 22:43:44,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8802 to 6981. [2019-11-15 22:43:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6981 states. [2019-11-15 22:43:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6981 states to 6981 states and 8647 transitions. [2019-11-15 22:43:44,804 INFO L78 Accepts]: Start accepts. Automaton has 6981 states and 8647 transitions. Word has length 133 [2019-11-15 22:43:44,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:44,805 INFO L462 AbstractCegarLoop]: Abstraction has 6981 states and 8647 transitions. [2019-11-15 22:43:44,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:43:44,806 INFO L276 IsEmpty]: Start isEmpty. Operand 6981 states and 8647 transitions. [2019-11-15 22:43:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 22:43:44,810 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:44,810 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-15 22:43:44,811 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:44,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:44,811 INFO L82 PathProgramCache]: Analyzing trace with hash 567275381, now seen corresponding path program 1 times [2019-11-15 22:43:44,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:44,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304594475] [2019-11-15 22:43:44,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:44,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:44,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:45,022 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 79 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-15 22:43:45,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304594475] [2019-11-15 22:43:45,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187506774] [2019-11-15 22:43:45,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef494285-3243-45a2-9ec7-d5ab95d59ba4/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-15 22:43:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:45,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:43:45,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:45,204 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:43:45,205 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:43:45,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-15 22:43:45,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360169052] [2019-11-15 22:43:45,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:43:45,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:45,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:43:45,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:45,207 INFO L87 Difference]: Start difference. First operand 6981 states and 8647 transitions. Second operand 3 states. [2019-11-15 22:43:46,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:46,997 INFO L93 Difference]: Finished difference Result 18446 states and 23055 transitions. [2019-11-15 22:43:46,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:43:46,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-11-15 22:43:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:47,049 INFO L225 Difference]: With dead ends: 18446 [2019-11-15 22:43:47,049 INFO L226 Difference]: Without dead ends: 11467 [2019-11-15 22:43:47,056 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 201 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-15 22:43:47,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11467 states. [2019-11-15 22:43:47,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11467 to 7877. [2019-11-15 22:43:47,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7877 states. [2019-11-15 22:43:47,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7877 states to 7877 states and 9624 transitions. [2019-11-15 22:43:47,240 INFO L78 Accepts]: Start accepts. Automaton has 7877 states and 9624 transitions. Word has length 201 [2019-11-15 22:43:47,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:47,240 INFO L462 AbstractCegarLoop]: Abstraction has 7877 states and 9624 transitions. [2019-11-15 22:43:47,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:43:47,241 INFO L276 IsEmpty]: Start isEmpty. Operand 7877 states and 9624 transitions. [2019-11-15 22:43:47,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-11-15 22:43:47,245 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:47,245 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:43:47,450 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:43:47,450 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:47,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:47,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1182281445, now seen corresponding path program 1 times [2019-11-15 22:43:47,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:47,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943094998] [2019-11-15 22:43:47,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:47,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:47,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:47,998 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-15 22:43:47,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943094998] [2019-11-15 22:43:47,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:47,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:47,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090099357] [2019-11-15 22:43:48,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:43:48,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:48,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:43:48,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:48,005 INFO L87 Difference]: Start difference. First operand 7877 states and 9624 transitions. Second operand 5 states. [2019-11-15 22:43:52,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:52,305 INFO L93 Difference]: Finished difference Result 16951 states and 20539 transitions. [2019-11-15 22:43:52,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:52,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 303 [2019-11-15 22:43:52,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:52,323 INFO L225 Difference]: With dead ends: 16951 [2019-11-15 22:43:52,324 INFO L226 Difference]: Without dead ends: 9076 [2019-11-15 22:43:52,331 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:43:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9076 states. [2019-11-15 22:43:52,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9076 to 8774. [2019-11-15 22:43:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8774 states. [2019-11-15 22:43:52,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8774 states to 8774 states and 10553 transitions. [2019-11-15 22:43:52,469 INFO L78 Accepts]: Start accepts. Automaton has 8774 states and 10553 transitions. Word has length 303 [2019-11-15 22:43:52,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:52,470 INFO L462 AbstractCegarLoop]: Abstraction has 8774 states and 10553 transitions. [2019-11-15 22:43:52,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:43:52,478 INFO L276 IsEmpty]: Start isEmpty. Operand 8774 states and 10553 transitions. [2019-11-15 22:43:52,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-11-15 22:43:52,486 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:52,487 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:43:52,487 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:52,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:52,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1620854953, now seen corresponding path program 1 times [2019-11-15 22:43:52,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:52,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444131452] [2019-11-15 22:43:52,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:52,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:52,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:52,810 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 22:43:52,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444131452] [2019-11-15 22:43:52,810 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:43:52,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:43:52,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885390952] [2019-11-15 22:43:52,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:52,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:52,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:52,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:52,813 INFO L87 Difference]: Start difference. First operand 8774 states and 10553 transitions. Second operand 4 states. [2019-11-15 22:43:55,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:43:55,897 INFO L93 Difference]: Finished difference Result 20539 states and 24805 transitions. [2019-11-15 22:43:55,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:43:55,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 388 [2019-11-15 22:43:55,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:43:55,920 INFO L225 Difference]: With dead ends: 20539 [2019-11-15 22:43:55,920 INFO L226 Difference]: Without dead ends: 11767 [2019-11-15 22:43:55,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:43:55,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11767 states. [2019-11-15 22:43:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11767 to 10269. [2019-11-15 22:43:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10269 states. [2019-11-15 22:43:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10269 states to 10269 states and 11835 transitions. [2019-11-15 22:43:56,065 INFO L78 Accepts]: Start accepts. Automaton has 10269 states and 11835 transitions. Word has length 388 [2019-11-15 22:43:56,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:43:56,066 INFO L462 AbstractCegarLoop]: Abstraction has 10269 states and 11835 transitions. [2019-11-15 22:43:56,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:43:56,066 INFO L276 IsEmpty]: Start isEmpty. Operand 10269 states and 11835 transitions. [2019-11-15 22:43:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-11-15 22:43:56,073 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:43:56,075 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:43:56,076 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:43:56,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:43:56,076 INFO L82 PathProgramCache]: Analyzing trace with hash -944442415, now seen corresponding path program 1 times [2019-11-15 22:43:56,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:43:56,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184964838] [2019-11-15 22:43:56,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:56,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:43:56,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:43:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 79 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:43:56,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184964838] [2019-11-15 22:43:56,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845813392] [2019-11-15 22:43:56,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef494285-3243-45a2-9ec7-d5ab95d59ba4/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:43:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:43:56,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:43:56,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:43:56,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:43:56,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:43:56,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:43:56,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:43:56,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:43:56,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:43:56,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:43:56,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:43:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-15 22:43:57,578 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:43:57,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-15 22:43:57,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270635411] [2019-11-15 22:43:57,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:43:57,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:43:57,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:43:57,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:43:57,581 INFO L87 Difference]: Start difference. First operand 10269 states and 11835 transitions. Second operand 4 states. [2019-11-15 22:44:02,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:02,449 INFO L93 Difference]: Finished difference Result 29527 states and 34112 transitions. [2019-11-15 22:44:02,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:44:02,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 389 [2019-11-15 22:44:02,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:02,472 INFO L225 Difference]: With dead ends: 29527 [2019-11-15 22:44:02,472 INFO L226 Difference]: Without dead ends: 16569 [2019-11-15 22:44:02,484 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:44:02,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16569 states. [2019-11-15 22:44:02,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16569 to 16568. [2019-11-15 22:44:02,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16568 states. [2019-11-15 22:44:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16568 states to 16568 states and 18187 transitions. [2019-11-15 22:44:02,698 INFO L78 Accepts]: Start accepts. Automaton has 16568 states and 18187 transitions. Word has length 389 [2019-11-15 22:44:02,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:02,699 INFO L462 AbstractCegarLoop]: Abstraction has 16568 states and 18187 transitions. [2019-11-15 22:44:02,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:44:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 16568 states and 18187 transitions. [2019-11-15 22:44:02,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2019-11-15 22:44:02,713 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:02,713 INFO L380 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:44:02,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:44:02,926 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:02,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:02,926 INFO L82 PathProgramCache]: Analyzing trace with hash 686982241, now seen corresponding path program 1 times [2019-11-15 22:44:02,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:02,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557682604] [2019-11-15 22:44:02,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:02,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:02,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-15 22:44:03,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557682604] [2019-11-15 22:44:03,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:44:03,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:44:03,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187788524] [2019-11-15 22:44:03,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:44:03,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:03,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:44:03,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:44:03,536 INFO L87 Difference]: Start difference. First operand 16568 states and 18187 transitions. Second operand 4 states. [2019-11-15 22:44:06,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:06,894 INFO L93 Difference]: Finished difference Result 36430 states and 40073 transitions. [2019-11-15 22:44:06,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:44:06,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 515 [2019-11-15 22:44:06,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:06,916 INFO L225 Difference]: With dead ends: 36430 [2019-11-15 22:44:06,916 INFO L226 Difference]: Without dead ends: 19864 [2019-11-15 22:44:06,931 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:44:06,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19864 states. [2019-11-15 22:44:07,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19864 to 18659. [2019-11-15 22:44:07,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18659 states. [2019-11-15 22:44:07,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18659 states to 18659 states and 20210 transitions. [2019-11-15 22:44:07,143 INFO L78 Accepts]: Start accepts. Automaton has 18659 states and 20210 transitions. Word has length 515 [2019-11-15 22:44:07,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:07,144 INFO L462 AbstractCegarLoop]: Abstraction has 18659 states and 20210 transitions. [2019-11-15 22:44:07,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:44:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 18659 states and 20210 transitions. [2019-11-15 22:44:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2019-11-15 22:44:07,156 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:07,157 INFO L380 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:44:07,157 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:07,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:07,158 INFO L82 PathProgramCache]: Analyzing trace with hash -692568243, now seen corresponding path program 1 times [2019-11-15 22:44:07,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:07,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692690615] [2019-11-15 22:44:07,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:07,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:07,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:07,496 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2019-11-15 22:44:07,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692690615] [2019-11-15 22:44:07,500 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:44:07,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:44:07,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116749105] [2019-11-15 22:44:07,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:44:07,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:07,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:44:07,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:44:07,502 INFO L87 Difference]: Start difference. First operand 18659 states and 20210 transitions. Second operand 3 states. [2019-11-15 22:44:09,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:09,157 INFO L93 Difference]: Finished difference Result 43294 states and 47016 transitions. [2019-11-15 22:44:09,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:44:09,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 519 [2019-11-15 22:44:09,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:09,181 INFO L225 Difference]: With dead ends: 43294 [2019-11-15 22:44:09,181 INFO L226 Difference]: Without dead ends: 22245 [2019-11-15 22:44:09,193 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:44:09,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22245 states. [2019-11-15 22:44:09,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22245 to 17443. [2019-11-15 22:44:09,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17443 states. [2019-11-15 22:44:09,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17443 states to 17443 states and 18611 transitions. [2019-11-15 22:44:09,411 INFO L78 Accepts]: Start accepts. Automaton has 17443 states and 18611 transitions. Word has length 519 [2019-11-15 22:44:09,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:09,412 INFO L462 AbstractCegarLoop]: Abstraction has 17443 states and 18611 transitions. [2019-11-15 22:44:09,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:44:09,412 INFO L276 IsEmpty]: Start isEmpty. Operand 17443 states and 18611 transitions. [2019-11-15 22:44:09,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2019-11-15 22:44:09,417 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:09,418 INFO L380 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:44:09,418 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:09,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:09,418 INFO L82 PathProgramCache]: Analyzing trace with hash -492530156, now seen corresponding path program 1 times [2019-11-15 22:44:09,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:09,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245613176] [2019-11-15 22:44:09,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:09,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:09,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-11-15 22:44:09,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245613176] [2019-11-15 22:44:09,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:44:09,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:44:09,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567070432] [2019-11-15 22:44:09,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:44:09,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:09,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:44:09,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:44:09,798 INFO L87 Difference]: Start difference. First operand 17443 states and 18611 transitions. Second operand 3 states. [2019-11-15 22:44:11,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:11,133 INFO L93 Difference]: Finished difference Result 37574 states and 40252 transitions. [2019-11-15 22:44:11,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:44:11,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 529 [2019-11-15 22:44:11,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:11,150 INFO L225 Difference]: With dead ends: 37574 [2019-11-15 22:44:11,150 INFO L226 Difference]: Without dead ends: 20133 [2019-11-15 22:44:11,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:44:11,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20133 states. [2019-11-15 22:44:11,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20133 to 18937. [2019-11-15 22:44:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18937 states. [2019-11-15 22:44:11,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18937 states to 18937 states and 20237 transitions. [2019-11-15 22:44:11,359 INFO L78 Accepts]: Start accepts. Automaton has 18937 states and 20237 transitions. Word has length 529 [2019-11-15 22:44:11,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:11,360 INFO L462 AbstractCegarLoop]: Abstraction has 18937 states and 20237 transitions. [2019-11-15 22:44:11,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:44:11,361 INFO L276 IsEmpty]: Start isEmpty. Operand 18937 states and 20237 transitions. [2019-11-15 22:44:11,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-11-15 22:44:11,371 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:11,372 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:44:11,372 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:11,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:11,373 INFO L82 PathProgramCache]: Analyzing trace with hash -918157725, now seen corresponding path program 1 times [2019-11-15 22:44:11,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:11,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325666586] [2019-11-15 22:44:11,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:11,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:11,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-11-15 22:44:12,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325666586] [2019-11-15 22:44:12,037 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:44:12,038 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:44:12,038 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122811191] [2019-11-15 22:44:12,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:44:12,039 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:12,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:44:12,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:44:12,040 INFO L87 Difference]: Start difference. First operand 18937 states and 20237 transitions. Second operand 3 states. [2019-11-15 22:44:13,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:13,322 INFO L93 Difference]: Finished difference Result 41160 states and 44007 transitions. [2019-11-15 22:44:13,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:44:13,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 597 [2019-11-15 22:44:13,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:13,341 INFO L225 Difference]: With dead ends: 41160 [2019-11-15 22:44:13,341 INFO L226 Difference]: Without dead ends: 22225 [2019-11-15 22:44:13,352 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:44:13,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22225 states. [2019-11-15 22:44:13,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22225 to 20730. [2019-11-15 22:44:13,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20730 states. [2019-11-15 22:44:13,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20730 states to 20730 states and 22114 transitions. [2019-11-15 22:44:13,533 INFO L78 Accepts]: Start accepts. Automaton has 20730 states and 22114 transitions. Word has length 597 [2019-11-15 22:44:13,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:13,534 INFO L462 AbstractCegarLoop]: Abstraction has 20730 states and 22114 transitions. [2019-11-15 22:44:13,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:44:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 20730 states and 22114 transitions. [2019-11-15 22:44:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2019-11-15 22:44:13,546 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:13,546 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:44:13,547 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:13,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:13,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1464563068, now seen corresponding path program 1 times [2019-11-15 22:44:13,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:13,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660709322] [2019-11-15 22:44:13,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:13,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:13,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 495 proven. 134 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-15 22:44:14,534 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660709322] [2019-11-15 22:44:14,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086866272] [2019-11-15 22:44:14,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ef494285-3243-45a2-9ec7-d5ab95d59ba4/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:44:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:14,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:44:14,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:44:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-11-15 22:44:14,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:44:14,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-15 22:44:14,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553106186] [2019-11-15 22:44:14,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:44:14,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:14,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:44:14,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:44:14,904 INFO L87 Difference]: Start difference. First operand 20730 states and 22114 transitions. Second operand 3 states. [2019-11-15 22:44:16,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:16,154 INFO L93 Difference]: Finished difference Result 41461 states and 44230 transitions. [2019-11-15 22:44:16,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:44:16,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 621 [2019-11-15 22:44:16,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:16,171 INFO L225 Difference]: With dead ends: 41461 [2019-11-15 22:44:16,171 INFO L226 Difference]: Without dead ends: 20733 [2019-11-15 22:44:16,179 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 622 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:44:16,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20733 states. [2019-11-15 22:44:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20733 to 20431. [2019-11-15 22:44:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20431 states. [2019-11-15 22:44:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20431 states to 20431 states and 21515 transitions. [2019-11-15 22:44:16,351 INFO L78 Accepts]: Start accepts. Automaton has 20431 states and 21515 transitions. Word has length 621 [2019-11-15 22:44:16,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:16,352 INFO L462 AbstractCegarLoop]: Abstraction has 20431 states and 21515 transitions. [2019-11-15 22:44:16,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:44:16,352 INFO L276 IsEmpty]: Start isEmpty. Operand 20431 states and 21515 transitions. [2019-11-15 22:44:16,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2019-11-15 22:44:16,368 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:16,369 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:44:16,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:44:16,573 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:16,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:16,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1996393327, now seen corresponding path program 1 times [2019-11-15 22:44:16,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:16,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366732478] [2019-11-15 22:44:16,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:16,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:16,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:17,296 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-11-15 22:44:17,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366732478] [2019-11-15 22:44:17,296 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:44:17,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:44:17,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830396957] [2019-11-15 22:44:17,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:44:17,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:17,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:44:17,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:44:17,298 INFO L87 Difference]: Start difference. First operand 20431 states and 21515 transitions. Second operand 4 states. [2019-11-15 22:44:19,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:19,752 INFO L93 Difference]: Finished difference Result 47752 states and 50248 transitions. [2019-11-15 22:44:19,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:44:19,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 698 [2019-11-15 22:44:19,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:19,779 INFO L225 Difference]: With dead ends: 47752 [2019-11-15 22:44:19,779 INFO L226 Difference]: Without dead ends: 27323 [2019-11-15 22:44:19,788 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:44:19,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27323 states. [2019-11-15 22:44:20,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27323 to 24616. [2019-11-15 22:44:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24616 states. [2019-11-15 22:44:20,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24616 states to 24616 states and 25739 transitions. [2019-11-15 22:44:20,071 INFO L78 Accepts]: Start accepts. Automaton has 24616 states and 25739 transitions. Word has length 698 [2019-11-15 22:44:20,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:20,072 INFO L462 AbstractCegarLoop]: Abstraction has 24616 states and 25739 transitions. [2019-11-15 22:44:20,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:44:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 24616 states and 25739 transitions. [2019-11-15 22:44:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2019-11-15 22:44:20,103 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:44:20,103 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 22:44:20,104 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:44:20,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:44:20,104 INFO L82 PathProgramCache]: Analyzing trace with hash 936108751, now seen corresponding path program 1 times [2019-11-15 22:44:20,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:44:20,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288187859] [2019-11-15 22:44:20,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:20,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:44:20,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:44:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:44:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 611 proven. 0 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2019-11-15 22:44:20,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288187859] [2019-11-15 22:44:20,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:44:20,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:44:20,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852716409] [2019-11-15 22:44:20,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:44:20,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:44:20,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:44:20,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:44:20,724 INFO L87 Difference]: Start difference. First operand 24616 states and 25739 transitions. Second operand 3 states. [2019-11-15 22:44:21,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:44:21,987 INFO L93 Difference]: Finished difference Result 41992 states and 43700 transitions. [2019-11-15 22:44:21,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:44:21,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 820 [2019-11-15 22:44:21,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:44:21,988 INFO L225 Difference]: With dead ends: 41992 [2019-11-15 22:44:21,988 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:44:21,996 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:44:21,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:44:21,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:44:21,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:44:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:44:21,997 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 820 [2019-11-15 22:44:21,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:44:21,997 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:44:21,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:44:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:44:21,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:44:22,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:44:22,390 WARN L191 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 233 [2019-11-15 22:44:22,666 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 233 [2019-11-15 22:44:22,933 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 233 [2019-11-15 22:44:24,263 WARN L191 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 225 DAG size of output: 94 [2019-11-15 22:44:25,475 WARN L191 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 225 DAG size of output: 94 [2019-11-15 22:44:26,712 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 225 DAG size of output: 94 [2019-11-15 22:44:26,715 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,716 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,716 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,716 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,716 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-15 22:44:26,716 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,716 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,716 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,716 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,716 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,716 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,716 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-15 22:44:26,716 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,716 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,716 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,716 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-15 22:44:26,717 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,717 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,717 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 22:44:26,717 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,717 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,717 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,717 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,717 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,717 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,717 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-15 22:44:26,717 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,717 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,717 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,717 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,717 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-15 22:44:26,717 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-15 22:44:26,717 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,718 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,718 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,718 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,718 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-15 22:44:26,718 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-15 22:44:26,718 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,718 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,718 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,718 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,718 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,718 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-15 22:44:26,718 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,718 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-15 22:44:26,718 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-15 22:44:26,718 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-15 22:44:26,718 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 22:44:26,719 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,719 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,719 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,719 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,719 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,719 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-15 22:44:26,719 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,719 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,719 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-15 22:44:26,719 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,719 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-15 22:44:26,719 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,720 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,721 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,721 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,721 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 22:44:26,721 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 22:44:26,721 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,721 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,721 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,721 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,721 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,721 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-15 22:44:26,721 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-15 22:44:26,721 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,721 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 22:44:26,721 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-15 22:44:26,721 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-15 22:44:26,721 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,721 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-15 22:44:26,721 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-15 22:44:26,721 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,722 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,722 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,722 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,722 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 22:44:26,722 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-15 22:44:26,722 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,722 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,722 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,722 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-15 22:44:26,722 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-15 22:44:26,722 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,722 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 22:44:26,722 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,723 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,723 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,723 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,723 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,723 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,723 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 22:44:26,723 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,723 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,723 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-15 22:44:26,724 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,724 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,724 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,724 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,724 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 22:44:26,724 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,724 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,724 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,724 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,724 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,724 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 22:44:26,724 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,725 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,725 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,725 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,725 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-15 22:44:26,725 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,725 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,725 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,726 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-15 22:44:26,726 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-15 22:44:26,726 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,726 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,726 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 22:44:26,726 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,726 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,726 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,726 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,726 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,726 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 22:44:26,726 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,726 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,726 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,727 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,727 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,727 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-15 22:44:26,727 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,727 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,727 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-15 22:44:26,727 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,727 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 22:44:26,727 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-15 22:44:26,728 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,728 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,728 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,728 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,728 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,728 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-15 22:44:26,728 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-15 22:44:26,728 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,728 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 22:44:26,728 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:44:26,728 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-15 22:44:26,728 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,728 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,728 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,728 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,728 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,728 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-15 22:44:26,729 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-15 22:44:26,729 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-15 22:44:26,729 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-15 22:44:26,729 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,729 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,729 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,729 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 22:44:26,729 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-15 22:44:26,729 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,729 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-15 22:44:26,729 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,729 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,729 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,730 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,730 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-15 22:44:26,730 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-15 22:44:26,730 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 22:44:26,730 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,730 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-15 22:44:26,730 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,731 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,731 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,731 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,731 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,731 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,731 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,731 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,731 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-15 22:44:26,732 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 22:44:26,732 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-15 22:44:26,732 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-15 22:44:26,732 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,732 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,732 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,732 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,732 INFO L439 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse22 (+ ~a4~0 86))) (let ((.cse13 (+ ~a0~0 147)) (.cse9 (<= .cse22 0)) (.cse18 (+ ~a29~0 144)) (.cse21 (+ ~a0~0 44)) (.cse1 (+ ~a0~0 98))) (let ((.cse2 (<= ~a29~0 43)) (.cse8 (<= .cse1 0)) (.cse12 (< 0 .cse22)) (.cse4 (<= .cse21 0)) (.cse3 (< 0 .cse18)) (.cse15 (= 2 ~a2~0)) (.cse14 (< 0 (+ ~a29~0 16))) (.cse16 (let ((.cse19 (not (= ~a2~0 3))) (.cse20 (not (= 1 ~a2~0)))) (or (and .cse9 .cse19 .cse20) (and (and .cse19 (<= 0 .cse21)) .cse20)))) (.cse0 (= ~a2~0 1)) (.cse5 (<= .cse13 0)) (.cse10 (< 43 ~a29~0)) (.cse7 (not (= 5 ~a2~0))) (.cse11 (<= .cse18 0)) (.cse6 (<= 3 ~a2~0))) (or (and (and .cse0 (< 0 .cse1) .cse2 .cse3) .cse4) (and .cse5 .cse6) (and .cse7 .cse8 .cse6) (and .cse9 .cse0 .cse4 .cse10) (and .cse9 .cse11 .cse4 .cse6) (and .cse8 .cse0 .cse12 (< 0 .cse13)) (and .cse8 .cse14 .cse15) (and .cse0 .cse12 .cse14 .cse2) (and .cse9 .cse14 .cse6) (and .cse9 .cse5) (and .cse8 .cse12 .cse3 .cse6) (and (and .cse0 .cse11) .cse9) (and .cse7 .cse9 .cse4 .cse6) (and .cse16 .cse15) (and .cse0 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse17 (mod v_~a0~0_825 299926))) (and (<= (+ v_~a0~0_825 44) 0) (<= ~a0~0 (+ (* 5 (div (+ .cse17 (- 300072)) 5)) 3)) (= .cse17 0) (< .cse17 300072) (not (= (mod (+ .cse17 3) 5) 0)))))) (and .cse5 .cse15) (and .cse14 .cse16 .cse6) (and (and .cse0 .cse5) .cse10) (and .cse7 .cse9 .cse11 .cse6) (and .cse9 (= 4 ~a2~0)))))) [2019-11-15 22:44:26,732 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 22:44:26,732 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-15 22:44:26,733 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,733 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,733 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,733 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,733 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,733 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,733 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,733 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-15 22:44:26,733 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,733 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-15 22:44:26,733 INFO L446 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-15 22:44:26,733 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,733 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-15 22:44:26,733 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-15 22:44:26,733 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 22:44:26,733 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-15 22:44:26,734 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,734 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,734 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,734 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,734 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,734 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-15 22:44:26,734 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 22:44:26,734 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,735 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-15 22:44:26,735 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-15 22:44:26,735 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,735 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,735 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,735 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,735 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,735 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,736 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse22 (+ ~a4~0 86))) (let ((.cse13 (+ ~a0~0 147)) (.cse9 (<= .cse22 0)) (.cse18 (+ ~a29~0 144)) (.cse21 (+ ~a0~0 44)) (.cse1 (+ ~a0~0 98))) (let ((.cse2 (<= ~a29~0 43)) (.cse8 (<= .cse1 0)) (.cse12 (< 0 .cse22)) (.cse4 (<= .cse21 0)) (.cse3 (< 0 .cse18)) (.cse15 (= 2 ~a2~0)) (.cse14 (< 0 (+ ~a29~0 16))) (.cse16 (let ((.cse19 (not (= ~a2~0 3))) (.cse20 (not (= 1 ~a2~0)))) (or (and .cse9 .cse19 .cse20) (and (and .cse19 (<= 0 .cse21)) .cse20)))) (.cse0 (= ~a2~0 1)) (.cse5 (<= .cse13 0)) (.cse10 (< 43 ~a29~0)) (.cse7 (not (= 5 ~a2~0))) (.cse11 (<= .cse18 0)) (.cse6 (<= 3 ~a2~0))) (or (and (and .cse0 (< 0 .cse1) .cse2 .cse3) .cse4) (and .cse5 .cse6) (and .cse7 .cse8 .cse6) (and .cse9 .cse0 .cse4 .cse10) (and .cse9 .cse11 .cse4 .cse6) (and .cse8 .cse0 .cse12 (< 0 .cse13)) (and .cse8 .cse14 .cse15) (and .cse0 .cse12 .cse14 .cse2) (and .cse9 .cse14 .cse6) (and .cse9 .cse5) (and .cse8 .cse12 .cse3 .cse6) (and (and .cse0 .cse11) .cse9) (and .cse7 .cse9 .cse4 .cse6) (and .cse16 .cse15) (and .cse0 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse17 (mod v_~a0~0_825 299926))) (and (<= (+ v_~a0~0_825 44) 0) (<= ~a0~0 (+ (* 5 (div (+ .cse17 (- 300072)) 5)) 3)) (= .cse17 0) (< .cse17 300072) (not (= (mod (+ .cse17 3) 5) 0)))))) (and .cse5 .cse15) (and .cse14 .cse16 .cse6) (and (and .cse0 .cse5) .cse10) (and .cse7 .cse9 .cse11 .cse6) (and .cse9 (= 4 ~a2~0)))))) [2019-11-15 22:44:26,736 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,736 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 22:44:26,736 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-15 22:44:26,737 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,737 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,737 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,737 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,737 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,737 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,737 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 22:44:26,737 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-15 22:44:26,738 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,738 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,738 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-15 22:44:26,738 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,738 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,738 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,738 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,739 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,739 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,739 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-15 22:44:26,739 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-15 22:44:26,739 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,739 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,739 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,739 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,740 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,740 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,740 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:44:26,740 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 22:44:26,740 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,740 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-15 22:44:26,740 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,740 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,740 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,740 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,740 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,740 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,740 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,740 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-15 22:44:26,741 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-15 22:44:26,741 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,741 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,741 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,741 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,741 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,741 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,741 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,741 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 22:44:26,741 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-15 22:44:26,741 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,741 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,741 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,741 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,741 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,741 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,741 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,742 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-15 22:44:26,742 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-15 22:44:26,742 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,742 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 22:44:26,742 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 22:44:26,742 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,742 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,742 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,742 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,742 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,742 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,742 INFO L439 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse22 (+ ~a4~0 86))) (let ((.cse13 (+ ~a0~0 147)) (.cse9 (<= .cse22 0)) (.cse18 (+ ~a29~0 144)) (.cse21 (+ ~a0~0 44)) (.cse1 (+ ~a0~0 98))) (let ((.cse2 (<= ~a29~0 43)) (.cse8 (<= .cse1 0)) (.cse12 (< 0 .cse22)) (.cse4 (<= .cse21 0)) (.cse3 (< 0 .cse18)) (.cse15 (= 2 ~a2~0)) (.cse14 (< 0 (+ ~a29~0 16))) (.cse16 (let ((.cse19 (not (= ~a2~0 3))) (.cse20 (not (= 1 ~a2~0)))) (or (and .cse9 .cse19 .cse20) (and (and .cse19 (<= 0 .cse21)) .cse20)))) (.cse0 (= ~a2~0 1)) (.cse5 (<= .cse13 0)) (.cse10 (< 43 ~a29~0)) (.cse7 (not (= 5 ~a2~0))) (.cse11 (<= .cse18 0)) (.cse6 (<= 3 ~a2~0))) (or (and (and .cse0 (< 0 .cse1) .cse2 .cse3) .cse4) (and .cse5 .cse6) (and .cse7 .cse8 .cse6) (and .cse9 .cse0 .cse4 .cse10) (and .cse9 .cse11 .cse4 .cse6) (and .cse8 .cse0 .cse12 (< 0 .cse13)) (and .cse8 .cse14 .cse15) (and .cse0 .cse12 .cse14 .cse2) (and .cse9 .cse14 .cse6) (and .cse9 .cse5) (and .cse8 .cse12 .cse3 .cse6) (and (and .cse0 .cse11) .cse9) (and .cse7 .cse9 .cse4 .cse6) (and .cse16 .cse15) (and .cse0 .cse3 (exists ((v_~a0~0_825 Int)) (let ((.cse17 (mod v_~a0~0_825 299926))) (and (<= (+ v_~a0~0_825 44) 0) (<= ~a0~0 (+ (* 5 (div (+ .cse17 (- 300072)) 5)) 3)) (= .cse17 0) (< .cse17 300072) (not (= (mod (+ .cse17 3) 5) 0)))))) (and .cse5 .cse15) (and .cse14 .cse16 .cse6) (and (and .cse0 .cse5) .cse10) (and .cse7 .cse9 .cse11 .cse6) (and .cse9 (= 4 ~a2~0)))))) [2019-11-15 22:44:26,743 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-15 22:44:26,743 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-15 22:44:26,743 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,743 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,743 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2019-11-15 22:44:26,743 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,743 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,743 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,743 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,743 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,743 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,743 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-15 22:44:26,743 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 22:44:26,743 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,744 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-15 22:44:26,744 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-15 22:44:26,744 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,744 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,744 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,744 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,744 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,744 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-15 22:44:26,744 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-15 22:44:26,744 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,744 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,744 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,744 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,744 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-15 22:44:26,744 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-15 22:44:26,744 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-15 22:44:26,744 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,745 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-15 22:44:26,745 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 22:44:26,745 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,745 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,745 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,745 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,745 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,745 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,745 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,745 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-15 22:44:26,745 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-15 22:44:26,745 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,745 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,746 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,746 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-15 22:44:26,746 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,746 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:44:26,746 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,746 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-15 22:44:26,746 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,746 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,746 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,746 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,746 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,746 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,746 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,747 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-15 22:44:26,747 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-15 22:44:26,747 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,747 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-15 22:44:26,747 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,747 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,747 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,748 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-15 22:44:26,748 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,748 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,748 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,748 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,748 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-15 22:44:26,748 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,748 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,749 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-15 22:44:26,749 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-15 22:44:26,749 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,749 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,749 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,749 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-15 22:44:26,749 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,749 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,750 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,750 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,750 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,750 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 22:44:26,750 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,750 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,750 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-15 22:44:26,750 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-15 22:44:26,750 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,750 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 22:44:26,750 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-15 22:44:26,750 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,750 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 22:44:26,750 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,750 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-15 22:44:26,750 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-15 22:44:26,750 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,751 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,751 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-15 22:44:26,751 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-15 22:44:26,751 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-15 22:44:26,761 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,775 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:26,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:44:26 BoogieIcfgContainer [2019-11-15 22:44:26,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:44:26,794 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:44:26,794 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:44:26,794 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:44:26,795 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:43:26" (3/4) ... [2019-11-15 22:44:26,798 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:44:26,833 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-15 22:44:26,836 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 22:44:26,866 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((a2 == 1 && 0 < a0 + 98) && a29 <= 43) && 0 < a29 + 144) && a0 + 44 <= 0) || (a0 + 147 <= 0 && 3 <= a2)) || ((!(5 == a2) && a0 + 98 <= 0) && 3 <= a2)) || (((a4 + 86 <= 0 && a2 == 1) && a0 + 44 <= 0) && 43 < a29)) || (((a4 + 86 <= 0 && a29 + 144 <= 0) && a0 + 44 <= 0) && 3 <= a2)) || (((a0 + 98 <= 0 && a2 == 1) && 0 < a4 + 86) && 0 < a0 + 147)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2)) || (((a2 == 1 && 0 < a4 + 86) && 0 < a29 + 16) && a29 <= 43)) || ((a4 + 86 <= 0 && 0 < a29 + 16) && 3 <= a2)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (((a0 + 98 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 3 <= a2)) || ((a2 == 1 && a29 + 144 <= 0) && a4 + 86 <= 0)) || (((!(5 == a2) && a4 + 86 <= 0) && a0 + 44 <= 0) && 3 <= a2)) || ((((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && 2 == a2)) || ((a2 == 1 && 0 < a29 + 144) && (\exists v_~a0~0_825 : int :: (((v_~a0~0_825 + 44 <= 0 && a0 <= 5 * ((v_~a0~0_825 % 299926 + -300072) / 5) + 3) && v_~a0~0_825 % 299926 == 0) && v_~a0~0_825 % 299926 < 300072) && !((v_~a0~0_825 % 299926 + 3) % 5 == 0)))) || (a0 + 147 <= 0 && 2 == a2)) || ((0 < a29 + 16 && (((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2)))) && 3 <= a2)) || ((a2 == 1 && a0 + 147 <= 0) && 43 < a29)) || (((!(5 == a2) && a4 + 86 <= 0) && a29 + 144 <= 0) && 3 <= a2)) || (a4 + 86 <= 0 && 4 == a2) [2019-11-15 22:44:26,870 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((a2 == 1 && 0 < a0 + 98) && a29 <= 43) && 0 < a29 + 144) && a0 + 44 <= 0) || (a0 + 147 <= 0 && 3 <= a2)) || ((!(5 == a2) && a0 + 98 <= 0) && 3 <= a2)) || (((a4 + 86 <= 0 && a2 == 1) && a0 + 44 <= 0) && 43 < a29)) || (((a4 + 86 <= 0 && a29 + 144 <= 0) && a0 + 44 <= 0) && 3 <= a2)) || (((a0 + 98 <= 0 && a2 == 1) && 0 < a4 + 86) && 0 < a0 + 147)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2)) || (((a2 == 1 && 0 < a4 + 86) && 0 < a29 + 16) && a29 <= 43)) || ((a4 + 86 <= 0 && 0 < a29 + 16) && 3 <= a2)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (((a0 + 98 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 3 <= a2)) || ((a2 == 1 && a29 + 144 <= 0) && a4 + 86 <= 0)) || (((!(5 == a2) && a4 + 86 <= 0) && a0 + 44 <= 0) && 3 <= a2)) || ((((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && 2 == a2)) || ((a2 == 1 && 0 < a29 + 144) && (\exists v_~a0~0_825 : int :: (((v_~a0~0_825 + 44 <= 0 && a0 <= 5 * ((v_~a0~0_825 % 299926 + -300072) / 5) + 3) && v_~a0~0_825 % 299926 == 0) && v_~a0~0_825 % 299926 < 300072) && !((v_~a0~0_825 % 299926 + 3) % 5 == 0)))) || (a0 + 147 <= 0 && 2 == a2)) || ((0 < a29 + 16 && (((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2)))) && 3 <= a2)) || ((a2 == 1 && a0 + 147 <= 0) && 43 < a29)) || (((!(5 == a2) && a4 + 86 <= 0) && a29 + 144 <= 0) && 3 <= a2)) || (a4 + 86 <= 0 && 4 == a2) [2019-11-15 22:44:26,881 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((a2 == 1 && 0 < a0 + 98) && a29 <= 43) && 0 < a29 + 144) && a0 + 44 <= 0) || (a0 + 147 <= 0 && 3 <= a2)) || ((!(5 == a2) && a0 + 98 <= 0) && 3 <= a2)) || (((a4 + 86 <= 0 && a2 == 1) && a0 + 44 <= 0) && 43 < a29)) || (((a4 + 86 <= 0 && a29 + 144 <= 0) && a0 + 44 <= 0) && 3 <= a2)) || (((a0 + 98 <= 0 && a2 == 1) && 0 < a4 + 86) && 0 < a0 + 147)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2)) || (((a2 == 1 && 0 < a4 + 86) && 0 < a29 + 16) && a29 <= 43)) || ((a4 + 86 <= 0 && 0 < a29 + 16) && 3 <= a2)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (((a0 + 98 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 3 <= a2)) || ((a2 == 1 && a29 + 144 <= 0) && a4 + 86 <= 0)) || (((!(5 == a2) && a4 + 86 <= 0) && a0 + 44 <= 0) && 3 <= a2)) || ((((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && 2 == a2)) || ((a2 == 1 && 0 < a29 + 144) && (\exists v_~a0~0_825 : int :: (((v_~a0~0_825 + 44 <= 0 && a0 <= 5 * ((v_~a0~0_825 % 299926 + -300072) / 5) + 3) && v_~a0~0_825 % 299926 == 0) && v_~a0~0_825 % 299926 < 300072) && !((v_~a0~0_825 % 299926 + 3) % 5 == 0)))) || (a0 + 147 <= 0 && 2 == a2)) || ((0 < a29 + 16 && (((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2)))) && 3 <= a2)) || ((a2 == 1 && a0 + 147 <= 0) && 43 < a29)) || (((!(5 == a2) && a4 + 86 <= 0) && a29 + 144 <= 0) && 3 <= a2)) || (a4 + 86 <= 0 && 4 == a2) [2019-11-15 22:44:27,075 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ef494285-3243-45a2-9ec7-d5ab95d59ba4/bin/uautomizer/witness.graphml [2019-11-15 22:44:27,076 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:44:27,077 INFO L168 Benchmark]: Toolchain (without parser) took 65625.76 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 940.7 MB in the beginning and 1.7 GB in the end (delta: -786.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-15 22:44:27,077 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:44:27,078 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1272.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 940.7 MB in the beginning and 1.0 GB in the end (delta: -107.4 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:44:27,078 INFO L168 Benchmark]: Boogie Procedure Inliner took 196.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:44:27,078 INFO L168 Benchmark]: Boogie Preprocessor took 230.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 988.8 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:44:27,079 INFO L168 Benchmark]: RCFGBuilder took 2858.54 ms. Allocated memory is still 1.2 GB. Free memory was 988.8 MB in the beginning and 916.4 MB in the end (delta: 72.3 MB). Peak memory consumption was 160.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:44:27,079 INFO L168 Benchmark]: TraceAbstraction took 60781.77 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 916.4 MB in the beginning and 1.8 GB in the end (delta: -866.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-15 22:44:27,079 INFO L168 Benchmark]: Witness Printer took 282.08 ms. Allocated memory is still 3.0 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:44:27,081 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1272.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 940.7 MB in the beginning and 1.0 GB in the end (delta: -107.4 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 196.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 230.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 988.8 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2858.54 ms. Allocated memory is still 1.2 GB. Free memory was 988.8 MB in the beginning and 916.4 MB in the end (delta: 72.3 MB). Peak memory consumption was 160.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 60781.77 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 916.4 MB in the beginning and 1.8 GB in the end (delta: -866.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 282.08 ms. Allocated memory is still 3.0 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 1766]: Loop Invariant [2019-11-15 22:44:27,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,103 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,103 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,103 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((a2 == 1 && 0 < a0 + 98) && a29 <= 43) && 0 < a29 + 144) && a0 + 44 <= 0) || (a0 + 147 <= 0 && 3 <= a2)) || ((!(5 == a2) && a0 + 98 <= 0) && 3 <= a2)) || (((a4 + 86 <= 0 && a2 == 1) && a0 + 44 <= 0) && 43 < a29)) || (((a4 + 86 <= 0 && a29 + 144 <= 0) && a0 + 44 <= 0) && 3 <= a2)) || (((a0 + 98 <= 0 && a2 == 1) && 0 < a4 + 86) && 0 < a0 + 147)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2)) || (((a2 == 1 && 0 < a4 + 86) && 0 < a29 + 16) && a29 <= 43)) || ((a4 + 86 <= 0 && 0 < a29 + 16) && 3 <= a2)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (((a0 + 98 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 3 <= a2)) || ((a2 == 1 && a29 + 144 <= 0) && a4 + 86 <= 0)) || (((!(5 == a2) && a4 + 86 <= 0) && a0 + 44 <= 0) && 3 <= a2)) || ((((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && 2 == a2)) || ((a2 == 1 && 0 < a29 + 144) && (\exists v_~a0~0_825 : int :: (((v_~a0~0_825 + 44 <= 0 && a0 <= 5 * ((v_~a0~0_825 % 299926 + -300072) / 5) + 3) && v_~a0~0_825 % 299926 == 0) && v_~a0~0_825 % 299926 < 300072) && !((v_~a0~0_825 % 299926 + 3) % 5 == 0)))) || (a0 + 147 <= 0 && 2 == a2)) || ((0 < a29 + 16 && (((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2)))) && 3 <= a2)) || ((a2 == 1 && a0 + 147 <= 0) && 43 < a29)) || (((!(5 == a2) && a4 + 86 <= 0) && a29 + 144 <= 0) && 3 <= a2)) || (a4 + 86 <= 0 && 4 == a2) - InvariantResult [Line: 23]: Loop Invariant [2019-11-15 22:44:27,107 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,107 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,108 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,108 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,108 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((a2 == 1 && 0 < a0 + 98) && a29 <= 43) && 0 < a29 + 144) && a0 + 44 <= 0) || (a0 + 147 <= 0 && 3 <= a2)) || ((!(5 == a2) && a0 + 98 <= 0) && 3 <= a2)) || (((a4 + 86 <= 0 && a2 == 1) && a0 + 44 <= 0) && 43 < a29)) || (((a4 + 86 <= 0 && a29 + 144 <= 0) && a0 + 44 <= 0) && 3 <= a2)) || (((a0 + 98 <= 0 && a2 == 1) && 0 < a4 + 86) && 0 < a0 + 147)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2)) || (((a2 == 1 && 0 < a4 + 86) && 0 < a29 + 16) && a29 <= 43)) || ((a4 + 86 <= 0 && 0 < a29 + 16) && 3 <= a2)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (((a0 + 98 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 3 <= a2)) || ((a2 == 1 && a29 + 144 <= 0) && a4 + 86 <= 0)) || (((!(5 == a2) && a4 + 86 <= 0) && a0 + 44 <= 0) && 3 <= a2)) || ((((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && 2 == a2)) || ((a2 == 1 && 0 < a29 + 144) && (\exists v_~a0~0_825 : int :: (((v_~a0~0_825 + 44 <= 0 && a0 <= 5 * ((v_~a0~0_825 % 299926 + -300072) / 5) + 3) && v_~a0~0_825 % 299926 == 0) && v_~a0~0_825 % 299926 < 300072) && !((v_~a0~0_825 % 299926 + 3) % 5 == 0)))) || (a0 + 147 <= 0 && 2 == a2)) || ((0 < a29 + 16 && (((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2)))) && 3 <= a2)) || ((a2 == 1 && a0 + 147 <= 0) && 43 < a29)) || (((!(5 == a2) && a4 + 86 <= 0) && a29 + 144 <= 0) && 3 <= a2)) || (a4 + 86 <= 0 && 4 == a2) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-15 22:44:27,112 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,112 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-15 22:44:27,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((a2 == 1 && 0 < a0 + 98) && a29 <= 43) && 0 < a29 + 144) && a0 + 44 <= 0) || (a0 + 147 <= 0 && 3 <= a2)) || ((!(5 == a2) && a0 + 98 <= 0) && 3 <= a2)) || (((a4 + 86 <= 0 && a2 == 1) && a0 + 44 <= 0) && 43 < a29)) || (((a4 + 86 <= 0 && a29 + 144 <= 0) && a0 + 44 <= 0) && 3 <= a2)) || (((a0 + 98 <= 0 && a2 == 1) && 0 < a4 + 86) && 0 < a0 + 147)) || ((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2)) || (((a2 == 1 && 0 < a4 + 86) && 0 < a29 + 16) && a29 <= 43)) || ((a4 + 86 <= 0 && 0 < a29 + 16) && 3 <= a2)) || (a4 + 86 <= 0 && a0 + 147 <= 0)) || (((a0 + 98 <= 0 && 0 < a4 + 86) && 0 < a29 + 144) && 3 <= a2)) || ((a2 == 1 && a29 + 144 <= 0) && a4 + 86 <= 0)) || (((!(5 == a2) && a4 + 86 <= 0) && a0 + 44 <= 0) && 3 <= a2)) || ((((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && 2 == a2)) || ((a2 == 1 && 0 < a29 + 144) && (\exists v_~a0~0_825 : int :: (((v_~a0~0_825 + 44 <= 0 && a0 <= 5 * ((v_~a0~0_825 % 299926 + -300072) / 5) + 3) && v_~a0~0_825 % 299926 == 0) && v_~a0~0_825 % 299926 < 300072) && !((v_~a0~0_825 % 299926 + 3) % 5 == 0)))) || (a0 + 147 <= 0 && 2 == a2)) || ((0 < a29 + 16 && (((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2)))) && 3 <= a2)) || ((a2 == 1 && a0 + 147 <= 0) && 43 < a29)) || (((!(5 == a2) && a4 + 86 <= 0) && a29 + 144 <= 0) && 3 <= a2)) || (a4 + 86 <= 0 && 4 == a2) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 60.6s, OverallIterations: 15, TraceHistogramMax: 5, AutomataDifference: 44.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.7s, HoareTripleCheckerStatistics: 4603 SDtfs, 7835 SDslu, 795 SDs, 0 SdLazy, 22114 SolverSat, 4465 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 36.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1278 GetRequests, 1229 SyntacticMatches, 11 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24616occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 19533 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 232 NumberOfFragments, 1141 HoareAnnotationTreeSize, 4 FomulaSimplifications, 20214 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 4 FomulaSimplificationsInter, 15825 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 7185 NumberOfCodeBlocks, 7185 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 7167 ConstructedInterpolants, 40 QuantifiedInterpolants, 8383670 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1504 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 6008/6209 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...