./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label10.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/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 18ca292e2a6683e70db5d6df9f8f197b4b3fc163 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 09:41:18,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 09:41:18,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 09:41:18,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 09:41:18,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 09:41:18,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 09:41:18,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 09:41:18,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 09:41:18,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 09:41:18,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 09:41:18,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 09:41:18,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 09:41:18,701 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 09:41:18,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 09:41:18,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 09:41:18,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 09:41:18,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 09:41:18,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 09:41:18,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 09:41:18,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 09:41:18,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 09:41:18,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 09:41:18,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 09:41:18,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 09:41:18,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 09:41:18,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 09:41:18,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 09:41:18,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 09:41:18,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 09:41:18,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 09:41:18,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 09:41:18,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 09:41:18,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 09:41:18,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 09:41:18,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 09:41:18,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 09:41:18,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 09:41:18,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 09:41:18,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 09:41:18,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 09:41:18,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 09:41:18,735 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 09:41:18,753 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 09:41:18,753 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 09:41:18,754 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 09:41:18,754 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 09:41:18,754 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 09:41:18,755 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 09:41:18,755 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 09:41:18,755 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 09:41:18,755 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 09:41:18,755 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 09:41:18,756 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 09:41:18,756 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 09:41:18,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 09:41:18,757 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 09:41:18,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 09:41:18,757 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 09:41:18,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 09:41:18,757 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 09:41:18,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 09:41:18,758 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 09:41:18,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 09:41:18,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 09:41:18,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 09:41:18,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 09:41:18,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 09:41:18,759 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 09:41:18,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 09:41:18,759 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 09:41:18,760 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_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/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 -> 18ca292e2a6683e70db5d6df9f8f197b4b3fc163 [2019-11-20 09:41:18,918 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 09:41:18,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 09:41:18,931 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 09:41:18,932 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 09:41:18,932 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 09:41:18,933 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label10.c [2019-11-20 09:41:18,980 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/data/0014bacac/0e0dbbf5de1e45c191fdc56e61fd4a40/FLAG51c336e77 [2019-11-20 09:41:19,614 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 09:41:19,615 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/sv-benchmarks/c/eca-rers2012/Problem15_label10.c [2019-11-20 09:41:19,640 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/data/0014bacac/0e0dbbf5de1e45c191fdc56e61fd4a40/FLAG51c336e77 [2019-11-20 09:41:20,011 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/data/0014bacac/0e0dbbf5de1e45c191fdc56e61fd4a40 [2019-11-20 09:41:20,013 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 09:41:20,014 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 09:41:20,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 09:41:20,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 09:41:20,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 09:41:20,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:41:20" (1/1) ... [2019-11-20 09:41:20,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fd64ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:20, skipping insertion in model container [2019-11-20 09:41:20,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:41:20" (1/1) ... [2019-11-20 09:41:20,027 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 09:41:20,102 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 09:41:20,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:41:21,003 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 09:41:21,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:41:21,269 INFO L192 MainTranslator]: Completed translation [2019-11-20 09:41:21,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:21 WrapperNode [2019-11-20 09:41:21,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 09:41:21,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 09:41:21,271 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 09:41:21,271 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 09:41:21,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:21" (1/1) ... [2019-11-20 09:41:21,302 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:21" (1/1) ... [2019-11-20 09:41:21,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 09:41:21,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 09:41:21,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 09:41:21,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 09:41:21,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:21" (1/1) ... [2019-11-20 09:41:21,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:21" (1/1) ... [2019-11-20 09:41:21,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:21" (1/1) ... [2019-11-20 09:41:21,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:21" (1/1) ... [2019-11-20 09:41:21,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:21" (1/1) ... [2019-11-20 09:41:21,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:21" (1/1) ... [2019-11-20 09:41:21,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:21" (1/1) ... [2019-11-20 09:41:21,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 09:41:21,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 09:41:21,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 09:41:21,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 09:41:21,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 09:41:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 09:41:21,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 09:41:24,581 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 09:41:24,581 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-20 09:41:24,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:41:24 BoogieIcfgContainer [2019-11-20 09:41:24,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 09:41:24,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 09:41:24,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 09:41:24,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 09:41:24,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:41:20" (1/3) ... [2019-11-20 09:41:24,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccdcaac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:41:24, skipping insertion in model container [2019-11-20 09:41:24,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:41:21" (2/3) ... [2019-11-20 09:41:24,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccdcaac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:41:24, skipping insertion in model container [2019-11-20 09:41:24,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:41:24" (3/3) ... [2019-11-20 09:41:24,589 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label10.c [2019-11-20 09:41:24,597 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 09:41:24,605 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 09:41:24,615 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 09:41:24,654 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 09:41:24,654 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 09:41:24,655 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 09:41:24,655 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 09:41:24,655 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 09:41:24,655 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 09:41:24,655 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 09:41:24,656 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 09:41:24,687 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-20 09:41:24,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 09:41:24,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:41:24,694 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:41:24,694 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:41:24,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:41:24,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1089129850, now seen corresponding path program 1 times [2019-11-20 09:41:24,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:41:24,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078308182] [2019-11-20 09:41:24,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:41:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:41:24,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078308182] [2019-11-20 09:41:24,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:41:24,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 09:41:24,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435309171] [2019-11-20 09:41:25,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:41:25,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:41:25,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:41:25,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:41:25,015 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-20 09:41:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:41:30,318 INFO L93 Difference]: Finished difference Result 1470 states and 2719 transitions. [2019-11-20 09:41:30,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:41:30,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-20 09:41:30,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:41:30,342 INFO L225 Difference]: With dead ends: 1470 [2019-11-20 09:41:30,342 INFO L226 Difference]: Without dead ends: 978 [2019-11-20 09:41:30,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:41:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-11-20 09:41:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2019-11-20 09:41:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-11-20 09:41:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1472 transitions. [2019-11-20 09:41:30,441 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1472 transitions. Word has length 34 [2019-11-20 09:41:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:41:30,441 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 1472 transitions. [2019-11-20 09:41:30,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:41:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1472 transitions. [2019-11-20 09:41:30,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 09:41:30,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:41:30,446 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:41:30,446 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:41:30,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:41:30,447 INFO L82 PathProgramCache]: Analyzing trace with hash 513841653, now seen corresponding path program 1 times [2019-11-20 09:41:30,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:41:30,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171137712] [2019-11-20 09:41:30,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:41:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:41:30,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171137712] [2019-11-20 09:41:30,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:41:30,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:41:30,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236477954] [2019-11-20 09:41:30,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:41:30,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:41:30,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:41:30,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:41:30,621 INFO L87 Difference]: Start difference. First operand 976 states and 1472 transitions. Second operand 4 states. [2019-11-20 09:41:34,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:41:34,855 INFO L93 Difference]: Finished difference Result 3753 states and 5688 transitions. [2019-11-20 09:41:34,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:41:34,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-20 09:41:34,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:41:34,870 INFO L225 Difference]: With dead ends: 3753 [2019-11-20 09:41:34,871 INFO L226 Difference]: Without dead ends: 2779 [2019-11-20 09:41:34,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:41:34,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2779 states. [2019-11-20 09:41:34,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2779 to 2774. [2019-11-20 09:41:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2019-11-20 09:41:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 3761 transitions. [2019-11-20 09:41:34,947 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 3761 transitions. Word has length 99 [2019-11-20 09:41:34,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:41:34,948 INFO L462 AbstractCegarLoop]: Abstraction has 2774 states and 3761 transitions. [2019-11-20 09:41:34,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:41:34,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 3761 transitions. [2019-11-20 09:41:34,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-20 09:41:34,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:41:34,958 INFO L410 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, 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] [2019-11-20 09:41:34,959 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:41:34,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:41:34,959 INFO L82 PathProgramCache]: Analyzing trace with hash 41144329, now seen corresponding path program 1 times [2019-11-20 09:41:34,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:41:34,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645603058] [2019-11-20 09:41:34,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:41:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:35,279 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-20 09:41:35,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645603058] [2019-11-20 09:41:35,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882366224] [2019-11-20 09:41:35,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:41:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:35,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 09:41:35,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:41:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:41:35,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 09:41:35,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-20 09:41:35,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219521928] [2019-11-20 09:41:35,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:41:35,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:41:35,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:41:35,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:41:35,523 INFO L87 Difference]: Start difference. First operand 2774 states and 3761 transitions. Second operand 3 states. [2019-11-20 09:41:37,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:41:37,770 INFO L93 Difference]: Finished difference Result 7940 states and 10821 transitions. [2019-11-20 09:41:37,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:41:37,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-11-20 09:41:37,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:41:37,799 INFO L225 Difference]: With dead ends: 7940 [2019-11-20 09:41:37,799 INFO L226 Difference]: Without dead ends: 5168 [2019-11-20 09:41:37,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 244 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-20 09:41:37,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2019-11-20 09:41:37,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 3073. [2019-11-20 09:41:37,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2019-11-20 09:41:37,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 4114 transitions. [2019-11-20 09:41:37,889 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 4114 transitions. Word has length 244 [2019-11-20 09:41:37,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:41:37,890 INFO L462 AbstractCegarLoop]: Abstraction has 3073 states and 4114 transitions. [2019-11-20 09:41:37,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:41:37,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 4114 transitions. [2019-11-20 09:41:37,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-11-20 09:41:37,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:41:37,898 INFO L410 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:41:38,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:41:38,101 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:41:38,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:41:38,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1594241081, now seen corresponding path program 1 times [2019-11-20 09:41:38,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:41:38,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309604617] [2019-11-20 09:41:38,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:41:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:38,743 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 09:41:38,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309604617] [2019-11-20 09:41:38,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:41:38,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:41:38,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842406822] [2019-11-20 09:41:38,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 09:41:38,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:41:38,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 09:41:38,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:41:38,746 INFO L87 Difference]: Start difference. First operand 3073 states and 4114 transitions. Second operand 5 states. [2019-11-20 09:41:42,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:41:42,060 INFO L93 Difference]: Finished difference Result 7342 states and 9540 transitions. [2019-11-20 09:41:42,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:41:42,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 312 [2019-11-20 09:41:42,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:41:42,103 INFO L225 Difference]: With dead ends: 7342 [2019-11-20 09:41:42,103 INFO L226 Difference]: Without dead ends: 4271 [2019-11-20 09:41:42,108 INFO L630 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-20 09:41:42,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2019-11-20 09:41:42,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 3971. [2019-11-20 09:41:42,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3971 states. [2019-11-20 09:41:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 5078 transitions. [2019-11-20 09:41:42,188 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 5078 transitions. Word has length 312 [2019-11-20 09:41:42,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:41:42,190 INFO L462 AbstractCegarLoop]: Abstraction has 3971 states and 5078 transitions. [2019-11-20 09:41:42,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 09:41:42,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 5078 transitions. [2019-11-20 09:41:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-11-20 09:41:42,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:41:42,200 INFO L410 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:41:42,200 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:41:42,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:41:42,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1017767819, now seen corresponding path program 1 times [2019-11-20 09:41:42,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:41:42,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417904310] [2019-11-20 09:41:42,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:41:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:41:42,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417904310] [2019-11-20 09:41:42,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:41:42,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:41:42,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346699339] [2019-11-20 09:41:42,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:41:42,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:41:42,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:41:42,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:41:42,544 INFO L87 Difference]: Start difference. First operand 3971 states and 5078 transitions. Second operand 4 states. [2019-11-20 09:41:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:41:45,571 INFO L93 Difference]: Finished difference Result 9739 states and 12737 transitions. [2019-11-20 09:41:45,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:41:45,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 386 [2019-11-20 09:41:45,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:41:45,601 INFO L225 Difference]: With dead ends: 9739 [2019-11-20 09:41:45,601 INFO L226 Difference]: Without dead ends: 5770 [2019-11-20 09:41:45,607 INFO L630 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-20 09:41:45,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2019-11-20 09:41:45,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5767. [2019-11-20 09:41:45,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5767 states. [2019-11-20 09:41:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 7242 transitions. [2019-11-20 09:41:45,721 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 7242 transitions. Word has length 386 [2019-11-20 09:41:45,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:41:45,722 INFO L462 AbstractCegarLoop]: Abstraction has 5767 states and 7242 transitions. [2019-11-20 09:41:45,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:41:45,722 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 7242 transitions. [2019-11-20 09:41:45,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-11-20 09:41:45,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:41:45,732 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:41:45,732 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:41:45,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:41:45,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1359235136, now seen corresponding path program 1 times [2019-11-20 09:41:45,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:41:45,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232305847] [2019-11-20 09:41:45,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:41:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:46,869 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 380 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 09:41:46,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232305847] [2019-11-20 09:41:46,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033877482] [2019-11-20 09:41:46,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/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-20 09:41:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:47,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 09:41:47,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:41:47,180 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-20 09:41:47,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 09:41:47,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-20 09:41:47,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811734933] [2019-11-20 09:41:47,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:41:47,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:41:47,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:41:47,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 09:41:47,183 INFO L87 Difference]: Start difference. First operand 5767 states and 7242 transitions. Second operand 3 states. [2019-11-20 09:41:48,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:41:48,651 INFO L93 Difference]: Finished difference Result 11532 states and 14482 transitions. [2019-11-20 09:41:48,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:41:48,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 461 [2019-11-20 09:41:48,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:41:48,687 INFO L225 Difference]: With dead ends: 11532 [2019-11-20 09:41:48,687 INFO L226 Difference]: Without dead ends: 5767 [2019-11-20 09:41:48,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 460 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 09:41:48,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2019-11-20 09:41:48,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5767. [2019-11-20 09:41:48,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5767 states. [2019-11-20 09:41:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 7110 transitions. [2019-11-20 09:41:48,803 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 7110 transitions. Word has length 461 [2019-11-20 09:41:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:41:48,804 INFO L462 AbstractCegarLoop]: Abstraction has 5767 states and 7110 transitions. [2019-11-20 09:41:48,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:41:48,804 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 7110 transitions. [2019-11-20 09:41:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-11-20 09:41:48,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:41:48,818 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:41:49,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:41:49,023 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:41:49,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:41:49,023 INFO L82 PathProgramCache]: Analyzing trace with hash 746660272, now seen corresponding path program 1 times [2019-11-20 09:41:49,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:41:49,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128226013] [2019-11-20 09:41:49,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:41:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 260 proven. 134 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 09:41:50,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128226013] [2019-11-20 09:41:50,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767087030] [2019-11-20 09:41:50,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/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-20 09:41:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:50,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 09:41:50,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:41:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-20 09:41:50,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 09:41:50,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-20 09:41:50,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116492661] [2019-11-20 09:41:50,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:41:50,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:41:50,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:41:50,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 09:41:50,530 INFO L87 Difference]: Start difference. First operand 5767 states and 7110 transitions. Second operand 3 states. [2019-11-20 09:41:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:41:52,610 INFO L93 Difference]: Finished difference Result 11531 states and 14218 transitions. [2019-11-20 09:41:52,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:41:52,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 537 [2019-11-20 09:41:52,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:41:52,642 INFO L225 Difference]: With dead ends: 11531 [2019-11-20 09:41:52,642 INFO L226 Difference]: Without dead ends: 5766 [2019-11-20 09:41:52,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 538 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-20 09:41:52,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2019-11-20 09:41:52,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 5764. [2019-11-20 09:41:52,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5764 states. [2019-11-20 09:41:52,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5764 states to 5764 states and 6589 transitions. [2019-11-20 09:41:52,733 INFO L78 Accepts]: Start accepts. Automaton has 5764 states and 6589 transitions. Word has length 537 [2019-11-20 09:41:52,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:41:52,734 INFO L462 AbstractCegarLoop]: Abstraction has 5764 states and 6589 transitions. [2019-11-20 09:41:52,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:41:52,734 INFO L276 IsEmpty]: Start isEmpty. Operand 5764 states and 6589 transitions. [2019-11-20 09:41:52,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2019-11-20 09:41:52,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:41:52,750 INFO L410 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, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:41:52,953 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:41:52,957 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:41:52,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:41:52,957 INFO L82 PathProgramCache]: Analyzing trace with hash -941780573, now seen corresponding path program 1 times [2019-11-20 09:41:52,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:41:52,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790306144] [2019-11-20 09:41:52,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:41:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 567 proven. 3 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-20 09:41:54,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790306144] [2019-11-20 09:41:54,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740344983] [2019-11-20 09:41:54,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:41:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:54,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 09:41:54,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:41:54,552 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2019-11-20 09:41:54,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 09:41:54,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-20 09:41:54,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738443755] [2019-11-20 09:41:54,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:41:54,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:41:54,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:41:54,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 09:41:54,554 INFO L87 Difference]: Start difference. First operand 5764 states and 6589 transitions. Second operand 3 states. [2019-11-20 09:41:56,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:41:56,247 INFO L93 Difference]: Finished difference Result 13020 states and 14983 transitions. [2019-11-20 09:41:56,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:41:56,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 562 [2019-11-20 09:41:56,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:41:56,268 INFO L225 Difference]: With dead ends: 13020 [2019-11-20 09:41:56,268 INFO L226 Difference]: Without dead ends: 7258 [2019-11-20 09:41:56,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 561 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 09:41:56,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7258 states. [2019-11-20 09:41:56,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7258 to 7258. [2019-11-20 09:41:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7258 states. [2019-11-20 09:41:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7258 states to 7258 states and 8190 transitions. [2019-11-20 09:41:56,360 INFO L78 Accepts]: Start accepts. Automaton has 7258 states and 8190 transitions. Word has length 562 [2019-11-20 09:41:56,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:41:56,361 INFO L462 AbstractCegarLoop]: Abstraction has 7258 states and 8190 transitions. [2019-11-20 09:41:56,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:41:56,361 INFO L276 IsEmpty]: Start isEmpty. Operand 7258 states and 8190 transitions. [2019-11-20 09:41:56,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2019-11-20 09:41:56,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:41:56,375 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:41:56,578 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:41:56,579 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:41:56,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:41:56,579 INFO L82 PathProgramCache]: Analyzing trace with hash -95465411, now seen corresponding path program 1 times [2019-11-20 09:41:56,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:41:56,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966751624] [2019-11-20 09:41:56,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:41:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 354 proven. 32 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-20 09:41:57,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966751624] [2019-11-20 09:41:57,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532814413] [2019-11-20 09:41:57,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:41:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:41:57,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 09:41:57,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:41:57,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:41:57,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:41:57,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:41:57,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:41:57,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:41:57,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:41:57,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:41:58,345 WARN L191 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 17 [2019-11-20 09:41:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2019-11-20 09:41:58,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 09:41:58,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-20 09:41:58,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039234018] [2019-11-20 09:41:58,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:41:58,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:41:58,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:41:58,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 09:41:58,737 INFO L87 Difference]: Start difference. First operand 7258 states and 8190 transitions. Second operand 3 states. [2019-11-20 09:42:39,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:42:39,847 INFO L93 Difference]: Finished difference Result 20211 states and 22785 transitions. [2019-11-20 09:42:39,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:42:39,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 596 [2019-11-20 09:42:39,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:42:39,870 INFO L225 Difference]: With dead ends: 20211 [2019-11-20 09:42:39,870 INFO L226 Difference]: Without dead ends: 12955 [2019-11-20 09:42:39,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 596 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 09:42:39,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12955 states. [2019-11-20 09:42:40,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12955 to 11746. [2019-11-20 09:42:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11746 states. [2019-11-20 09:42:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11746 states to 11746 states and 13247 transitions. [2019-11-20 09:42:40,041 INFO L78 Accepts]: Start accepts. Automaton has 11746 states and 13247 transitions. Word has length 596 [2019-11-20 09:42:40,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:42:40,043 INFO L462 AbstractCegarLoop]: Abstraction has 11746 states and 13247 transitions. [2019-11-20 09:42:40,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:42:40,043 INFO L276 IsEmpty]: Start isEmpty. Operand 11746 states and 13247 transitions. [2019-11-20 09:42:40,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-11-20 09:42:40,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:42:40,057 INFO L410 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, 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, 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] [2019-11-20 09:42:40,261 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:42:40,261 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:42:40,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:42:40,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1519482735, now seen corresponding path program 1 times [2019-11-20 09:42:40,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:42:40,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639999925] [2019-11-20 09:42:40,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:42:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:42:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 818 backedges. 631 proven. 3 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-11-20 09:42:41,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639999925] [2019-11-20 09:42:41,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715432142] [2019-11-20 09:42:41,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:42:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:42:41,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 09:42:41,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:42:41,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 09:42:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 818 backedges. 518 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-11-20 09:42:42,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 09:42:42,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2019-11-20 09:42:42,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961763957] [2019-11-20 09:42:42,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 09:42:42,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:42:42,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 09:42:42,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-20 09:42:42,441 INFO L87 Difference]: Start difference. First operand 11746 states and 13247 transitions. Second operand 5 states. [2019-11-20 09:42:46,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:42:46,119 INFO L93 Difference]: Finished difference Result 27530 states and 30993 transitions. [2019-11-20 09:42:46,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 09:42:46,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 675 [2019-11-20 09:42:46,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:42:46,138 INFO L225 Difference]: With dead ends: 27530 [2019-11-20 09:42:46,138 INFO L226 Difference]: Without dead ends: 15786 [2019-11-20 09:42:46,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 685 GetRequests, 674 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-20 09:42:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15786 states. [2019-11-20 09:42:46,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15786 to 15337. [2019-11-20 09:42:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15337 states. [2019-11-20 09:42:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15337 states to 15337 states and 17013 transitions. [2019-11-20 09:42:46,371 INFO L78 Accepts]: Start accepts. Automaton has 15337 states and 17013 transitions. Word has length 675 [2019-11-20 09:42:46,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:42:46,372 INFO L462 AbstractCegarLoop]: Abstraction has 15337 states and 17013 transitions. [2019-11-20 09:42:46,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 09:42:46,373 INFO L276 IsEmpty]: Start isEmpty. Operand 15337 states and 17013 transitions. [2019-11-20 09:42:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2019-11-20 09:42:46,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:42:46,393 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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-20 09:42:46,596 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:42:46,597 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:42:46,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:42:46,597 INFO L82 PathProgramCache]: Analyzing trace with hash -253950539, now seen corresponding path program 1 times [2019-11-20 09:42:46,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:42:46,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750609142] [2019-11-20 09:42:46,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:42:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:42:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 95 proven. 482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:42:48,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750609142] [2019-11-20 09:42:48,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871623936] [2019-11-20 09:42:48,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:42:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:42:48,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 09:42:48,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:42:48,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:42:48,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:42:48,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:42:48,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:42:48,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:42:48,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:42:48,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:42:48,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:42:48,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:42:48,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:42:48,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:42:49,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 09:42:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 470 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:42:51,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:42:51,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 14 [2019-11-20 09:42:51,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094238491] [2019-11-20 09:42:51,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 09:42:51,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:42:51,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 09:42:51,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-20 09:42:51,108 INFO L87 Difference]: Start difference. First operand 15337 states and 17013 transitions. Second operand 14 states. [2019-11-20 09:43:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:11,772 INFO L93 Difference]: Finished difference Result 61529 states and 67531 transitions. [2019-11-20 09:43:11,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-11-20 09:43:11,773 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 703 [2019-11-20 09:43:11,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:11,800 INFO L225 Difference]: With dead ends: 61529 [2019-11-20 09:43:11,801 INFO L226 Difference]: Without dead ends: 42605 [2019-11-20 09:43:11,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 793 GetRequests, 736 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=707, Invalid=2599, Unknown=0, NotChecked=0, Total=3306 [2019-11-20 09:43:11,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42605 states. [2019-11-20 09:43:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42605 to 25785. [2019-11-20 09:43:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25785 states. [2019-11-20 09:43:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25785 states to 25785 states and 27705 transitions. [2019-11-20 09:43:12,196 INFO L78 Accepts]: Start accepts. Automaton has 25785 states and 27705 transitions. Word has length 703 [2019-11-20 09:43:12,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:12,197 INFO L462 AbstractCegarLoop]: Abstraction has 25785 states and 27705 transitions. [2019-11-20 09:43:12,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 09:43:12,197 INFO L276 IsEmpty]: Start isEmpty. Operand 25785 states and 27705 transitions. [2019-11-20 09:43:12,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2019-11-20 09:43:12,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:12,234 INFO L410 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:43:12,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:43:12,439 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:12,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:12,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1586778385, now seen corresponding path program 1 times [2019-11-20 09:43:12,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:43:12,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773267359] [2019-11-20 09:43:12,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:43:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:13,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 889 trivial. 0 not checked. [2019-11-20 09:43:13,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773267359] [2019-11-20 09:43:13,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:43:13,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 09:43:13,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725924928] [2019-11-20 09:43:13,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:43:13,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:43:13,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:43:13,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:43:13,181 INFO L87 Difference]: Start difference. First operand 25785 states and 27705 transitions. Second operand 3 states. [2019-11-20 09:43:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:15,687 INFO L93 Difference]: Finished difference Result 54868 states and 58857 transitions. [2019-11-20 09:43:15,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:43:15,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 829 [2019-11-20 09:43:15,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:15,716 INFO L225 Difference]: With dead ends: 54868 [2019-11-20 09:43:15,716 INFO L226 Difference]: Without dead ends: 28786 [2019-11-20 09:43:15,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:43:15,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28786 states. [2019-11-20 09:43:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28786 to 24585. [2019-11-20 09:43:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24585 states. [2019-11-20 09:43:16,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24585 states to 24585 states and 26419 transitions. [2019-11-20 09:43:16,028 INFO L78 Accepts]: Start accepts. Automaton has 24585 states and 26419 transitions. Word has length 829 [2019-11-20 09:43:16,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:16,029 INFO L462 AbstractCegarLoop]: Abstraction has 24585 states and 26419 transitions. [2019-11-20 09:43:16,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:43:16,030 INFO L276 IsEmpty]: Start isEmpty. Operand 24585 states and 26419 transitions. [2019-11-20 09:43:16,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 877 [2019-11-20 09:43:16,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:16,060 INFO L410 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, 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, 3, 3, 3, 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, 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] [2019-11-20 09:43:16,060 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:16,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:16,061 INFO L82 PathProgramCache]: Analyzing trace with hash 508940287, now seen corresponding path program 1 times [2019-11-20 09:43:16,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:43:16,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728089079] [2019-11-20 09:43:16,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:43:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:19,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 128 proven. 809 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 09:43:19,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728089079] [2019-11-20 09:43:19,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002669716] [2019-11-20 09:43:19,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:43:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:19,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 1008 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 09:43:19,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:43:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 673 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-11-20 09:43:20,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 09:43:20,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-11-20 09:43:20,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142682787] [2019-11-20 09:43:20,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:43:20,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:43:20,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:43:20,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-20 09:43:20,111 INFO L87 Difference]: Start difference. First operand 24585 states and 26419 transitions. Second operand 3 states. [2019-11-20 09:43:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:21,387 INFO L93 Difference]: Finished difference Result 49168 states and 52836 transitions. [2019-11-20 09:43:21,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:43:21,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 876 [2019-11-20 09:43:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:21,412 INFO L225 Difference]: With dead ends: 49168 [2019-11-20 09:43:21,412 INFO L226 Difference]: Without dead ends: 24585 [2019-11-20 09:43:21,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 891 GetRequests, 876 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-20 09:43:21,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24585 states. [2019-11-20 09:43:21,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24585 to 23387. [2019-11-20 09:43:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23387 states. [2019-11-20 09:43:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23387 states to 23387 states and 24947 transitions. [2019-11-20 09:43:21,646 INFO L78 Accepts]: Start accepts. Automaton has 23387 states and 24947 transitions. Word has length 876 [2019-11-20 09:43:21,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:21,647 INFO L462 AbstractCegarLoop]: Abstraction has 23387 states and 24947 transitions. [2019-11-20 09:43:21,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:43:21,647 INFO L276 IsEmpty]: Start isEmpty. Operand 23387 states and 24947 transitions. [2019-11-20 09:43:21,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 882 [2019-11-20 09:43:21,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:21,668 INFO L410 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, 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, 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, 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] [2019-11-20 09:43:21,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:43:21,872 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:21,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:21,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1348202738, now seen corresponding path program 1 times [2019-11-20 09:43:21,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:43:21,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302979569] [2019-11-20 09:43:21,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:43:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 737 proven. 140 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-20 09:43:23,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302979569] [2019-11-20 09:43:23,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644917591] [2019-11-20 09:43:23,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:43:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:23,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 09:43:23,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:43:24,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 807 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-11-20 09:43:24,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 09:43:24,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-20 09:43:24,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238198782] [2019-11-20 09:43:24,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:43:24,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:43:24,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:43:24,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-20 09:43:24,271 INFO L87 Difference]: Start difference. First operand 23387 states and 24947 transitions. Second operand 3 states. [2019-11-20 09:43:25,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:25,486 INFO L93 Difference]: Finished difference Result 46770 states and 49842 transitions. [2019-11-20 09:43:25,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:43:25,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 881 [2019-11-20 09:43:25,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:25,502 INFO L225 Difference]: With dead ends: 46770 [2019-11-20 09:43:25,502 INFO L226 Difference]: Without dead ends: 23385 [2019-11-20 09:43:25,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 894 GetRequests, 882 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-20 09:43:25,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23385 states. [2019-11-20 09:43:25,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23385 to 23063. [2019-11-20 09:43:25,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23063 states. [2019-11-20 09:43:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23063 states to 23063 states and 24329 transitions. [2019-11-20 09:43:25,722 INFO L78 Accepts]: Start accepts. Automaton has 23063 states and 24329 transitions. Word has length 881 [2019-11-20 09:43:25,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:25,723 INFO L462 AbstractCegarLoop]: Abstraction has 23063 states and 24329 transitions. [2019-11-20 09:43:25,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:43:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 23063 states and 24329 transitions. [2019-11-20 09:43:25,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 896 [2019-11-20 09:43:25,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:25,737 INFO L410 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, 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, 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, 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] [2019-11-20 09:43:25,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:43:25,941 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:25,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:25,941 INFO L82 PathProgramCache]: Analyzing trace with hash -926627041, now seen corresponding path program 1 times [2019-11-20 09:43:25,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:43:25,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192991398] [2019-11-20 09:43:25,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:43:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-11-20 09:43:26,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192991398] [2019-11-20 09:43:26,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:43:26,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:43:26,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113382056] [2019-11-20 09:43:26,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:43:26,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:43:26,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:43:26,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:43:26,918 INFO L87 Difference]: Start difference. First operand 23063 states and 24329 transitions. Second operand 4 states. [2019-11-20 09:43:29,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:29,060 INFO L93 Difference]: Finished difference Result 55113 states and 58098 transitions. [2019-11-20 09:43:29,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:43:29,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 895 [2019-11-20 09:43:29,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:29,079 INFO L225 Difference]: With dead ends: 55113 [2019-11-20 09:43:29,079 INFO L226 Difference]: Without dead ends: 27268 [2019-11-20 09:43:29,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:43:29,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27268 states. [2019-11-20 09:43:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27268 to 19508. [2019-11-20 09:43:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19508 states. [2019-11-20 09:43:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19508 states to 19508 states and 20331 transitions. [2019-11-20 09:43:29,275 INFO L78 Accepts]: Start accepts. Automaton has 19508 states and 20331 transitions. Word has length 895 [2019-11-20 09:43:29,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:29,276 INFO L462 AbstractCegarLoop]: Abstraction has 19508 states and 20331 transitions. [2019-11-20 09:43:29,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:43:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 19508 states and 20331 transitions. [2019-11-20 09:43:29,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 968 [2019-11-20 09:43:29,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:29,291 INFO L410 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:43:29,291 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:29,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:29,292 INFO L82 PathProgramCache]: Analyzing trace with hash 625408752, now seen corresponding path program 1 times [2019-11-20 09:43:29,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:43:29,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872503625] [2019-11-20 09:43:29,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:43:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:32,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 783 proven. 140 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-11-20 09:43:32,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872503625] [2019-11-20 09:43:32,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914115437] [2019-11-20 09:43:32,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:43:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:32,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 09:43:32,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:43:32,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:43:32,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:32,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:32,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:32,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:32,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:32,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:33,987 WARN L191 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 33 DAG size of output: 19 [2019-11-20 09:43:33,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:43:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 730 proven. 32 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2019-11-20 09:43:34,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:43:34,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-11-20 09:43:34,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631011392] [2019-11-20 09:43:34,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 09:43:34,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:43:34,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 09:43:34,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-11-20 09:43:34,808 INFO L87 Difference]: Start difference. First operand 19508 states and 20331 transitions. Second operand 17 states. [2019-11-20 09:43:38,127 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-11-20 09:43:42,558 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-11-20 09:44:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:44:01,445 INFO L93 Difference]: Finished difference Result 54593 states and 56706 transitions. [2019-11-20 09:44:01,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-11-20 09:44:01,450 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 967 [2019-11-20 09:44:01,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:44:01,476 INFO L225 Difference]: With dead ends: 54593 [2019-11-20 09:44:01,477 INFO L226 Difference]: Without dead ends: 34779 [2019-11-20 09:44:01,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1130 GetRequests, 1009 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6002 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=2679, Invalid=12327, Unknown=0, NotChecked=0, Total=15006 [2019-11-20 09:44:01,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34779 states. [2019-11-20 09:44:01,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34779 to 23399. [2019-11-20 09:44:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23399 states. [2019-11-20 09:44:01,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23399 states to 23399 states and 24266 transitions. [2019-11-20 09:44:01,760 INFO L78 Accepts]: Start accepts. Automaton has 23399 states and 24266 transitions. Word has length 967 [2019-11-20 09:44:01,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:44:01,761 INFO L462 AbstractCegarLoop]: Abstraction has 23399 states and 24266 transitions. [2019-11-20 09:44:01,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 09:44:01,761 INFO L276 IsEmpty]: Start isEmpty. Operand 23399 states and 24266 transitions. [2019-11-20 09:44:01,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1073 [2019-11-20 09:44:01,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:44:01,790 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2019-11-20 09:44:01,992 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:44:01,994 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:44:01,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:44:01,994 INFO L82 PathProgramCache]: Analyzing trace with hash -19826569, now seen corresponding path program 1 times [2019-11-20 09:44:01,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:44:01,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625321450] [2019-11-20 09:44:01,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:44:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:44:02,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1999 backedges. 1247 proven. 0 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2019-11-20 09:44:02,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625321450] [2019-11-20 09:44:02,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:44:02,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 09:44:02,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087816057] [2019-11-20 09:44:02,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:44:02,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:44:02,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:44:02,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:44:02,952 INFO L87 Difference]: Start difference. First operand 23399 states and 24266 transitions. Second operand 3 states. [2019-11-20 09:44:04,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:44:04,349 INFO L93 Difference]: Finished difference Result 46495 states and 48226 transitions. [2019-11-20 09:44:04,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:44:04,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1072 [2019-11-20 09:44:04,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:44:04,365 INFO L225 Difference]: With dead ends: 46495 [2019-11-20 09:44:04,366 INFO L226 Difference]: Without dead ends: 23098 [2019-11-20 09:44:04,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:44:04,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23098 states. [2019-11-20 09:44:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23098 to 23098. [2019-11-20 09:44:04,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23098 states. [2019-11-20 09:44:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23098 states to 23098 states and 23960 transitions. [2019-11-20 09:44:04,597 INFO L78 Accepts]: Start accepts. Automaton has 23098 states and 23960 transitions. Word has length 1072 [2019-11-20 09:44:04,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:44:04,597 INFO L462 AbstractCegarLoop]: Abstraction has 23098 states and 23960 transitions. [2019-11-20 09:44:04,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:44:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 23098 states and 23960 transitions. [2019-11-20 09:44:04,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1092 [2019-11-20 09:44:04,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:44:04,623 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2019-11-20 09:44:04,623 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:44:04,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:44:04,624 INFO L82 PathProgramCache]: Analyzing trace with hash 781991861, now seen corresponding path program 1 times [2019-11-20 09:44:04,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:44:04,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195713863] [2019-11-20 09:44:04,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:44:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:44:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 1145 proven. 830 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-20 09:44:08,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195713863] [2019-11-20 09:44:08,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769050330] [2019-11-20 09:44:08,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:44:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:44:09,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 09:44:09,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:44:09,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:09,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 09:44:09,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:09,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 09:44:09,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 09:44:09,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:44:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 926 proven. 24 refuted. 0 times theorem prover too weak. 1131 trivial. 0 not checked. [2019-11-20 09:44:11,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:44:11,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7] total 22 [2019-11-20 09:44:11,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087041853] [2019-11-20 09:44:11,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 09:44:11,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:44:11,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 09:44:11,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2019-11-20 09:44:11,810 INFO L87 Difference]: Start difference. First operand 23098 states and 23960 transitions. Second operand 22 states. [2019-11-20 09:44:33,568 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-11-20 09:45:00,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:45:00,494 INFO L93 Difference]: Finished difference Result 69048 states and 70993 transitions. [2019-11-20 09:45:00,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2019-11-20 09:45:00,494 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1091 [2019-11-20 09:45:00,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:45:00,522 INFO L225 Difference]: With dead ends: 69048 [2019-11-20 09:45:00,522 INFO L226 Difference]: Without dead ends: 38616 [2019-11-20 09:45:00,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1338 GetRequests, 1179 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10247 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=3759, Invalid=21681, Unknown=0, NotChecked=0, Total=25440 [2019-11-20 09:45:00,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38616 states. [2019-11-20 09:45:00,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38616 to 15509. [2019-11-20 09:45:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15509 states. [2019-11-20 09:45:00,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15509 states to 15509 states and 15761 transitions. [2019-11-20 09:45:00,782 INFO L78 Accepts]: Start accepts. Automaton has 15509 states and 15761 transitions. Word has length 1091 [2019-11-20 09:45:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:45:00,783 INFO L462 AbstractCegarLoop]: Abstraction has 15509 states and 15761 transitions. [2019-11-20 09:45:00,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 09:45:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 15509 states and 15761 transitions. [2019-11-20 09:45:00,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1221 [2019-11-20 09:45:00,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:45:00,800 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 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, 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] [2019-11-20 09:45:01,001 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:45:01,001 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:45:01,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:45:01,001 INFO L82 PathProgramCache]: Analyzing trace with hash -111973134, now seen corresponding path program 1 times [2019-11-20 09:45:01,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:45:01,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504000519] [2019-11-20 09:45:01,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:45:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:45:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2060 backedges. 1013 proven. 32 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2019-11-20 09:45:05,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504000519] [2019-11-20 09:45:05,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132941904] [2019-11-20 09:45:05,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:45:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:45:05,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 1376 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 09:45:05,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:45:05,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:45:05,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:45:05,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:45:05,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:45:05,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:45:05,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:45:05,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:45:05,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:45:05,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:45:08,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2060 backedges. 1563 proven. 64 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2019-11-20 09:45:08,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:45:08,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2019-11-20 09:45:08,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70712787] [2019-11-20 09:45:08,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 09:45:08,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:45:08,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 09:45:08,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-11-20 09:45:08,321 INFO L87 Difference]: Start difference. First operand 15509 states and 15761 transitions. Second operand 18 states. [2019-11-20 09:45:50,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:45:50,815 INFO L93 Difference]: Finished difference Result 52090 states and 52945 transitions. [2019-11-20 09:45:50,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-11-20 09:45:50,816 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1220 [2019-11-20 09:45:50,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:45:50,817 INFO L225 Difference]: With dead ends: 52090 [2019-11-20 09:45:50,817 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 09:45:50,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1372 GetRequests, 1284 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2742 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1225, Invalid=6785, Unknown=0, NotChecked=0, Total=8010 [2019-11-20 09:45:50,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 09:45:50,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 09:45:50,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 09:45:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 09:45:50,832 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1220 [2019-11-20 09:45:50,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:45:50,833 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 09:45:50,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 09:45:50,833 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 09:45:50,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 09:45:51,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:45:51,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 09:45:55,925 WARN L191 SmtUtils]: Spent 4.88 s on a formula simplification. DAG size of input: 1067 DAG size of output: 906 [2019-11-20 09:46:00,326 WARN L191 SmtUtils]: Spent 4.40 s on a formula simplification. DAG size of input: 1067 DAG size of output: 906 [2019-11-20 09:46:01,700 WARN L191 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 757 DAG size of output: 694 [2019-11-20 09:46:16,183 WARN L191 SmtUtils]: Spent 14.47 s on a formula simplification. DAG size of input: 845 DAG size of output: 163 [2019-11-20 09:46:29,459 WARN L191 SmtUtils]: Spent 13.27 s on a formula simplification. DAG size of input: 845 DAG size of output: 163 [2019-11-20 09:46:37,560 WARN L191 SmtUtils]: Spent 8.10 s on a formula simplification. DAG size of input: 670 DAG size of output: 155 [2019-11-20 09:46:37,564 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,564 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,564 INFO L444 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,564 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,564 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-20 09:46:37,564 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,564 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,564 INFO L444 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,564 INFO L444 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,565 INFO L444 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,565 INFO L444 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,565 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-20 09:46:37,565 INFO L444 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,565 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,565 INFO L444 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,565 INFO L444 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-20 09:46:37,565 INFO L444 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,565 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,565 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-20 09:46:37,565 INFO L444 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,566 INFO L444 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,566 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,566 INFO L444 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,566 INFO L444 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,566 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,566 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-20 09:46:37,566 INFO L444 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,566 INFO L444 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,566 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,566 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,566 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-20 09:46:37,567 INFO L444 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-20 09:46:37,567 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,567 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,567 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,567 INFO L444 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,567 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-20 09:46:37,567 INFO L444 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-20 09:46:37,567 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,567 INFO L444 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,567 INFO L444 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,567 INFO L444 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,567 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,567 INFO L444 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-20 09:46:37,567 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,567 INFO L444 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-20 09:46:37,567 INFO L444 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-20 09:46:37,567 INFO L444 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-20 09:46:37,568 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-20 09:46:37,568 INFO L444 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,568 INFO L444 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,568 INFO L444 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,568 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,568 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,568 INFO L444 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-20 09:46:37,568 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,568 INFO L444 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,568 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-20 09:46:37,568 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,568 INFO L444 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-20 09:46:37,568 INFO L444 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,568 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,568 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,569 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-20 09:46:37,569 INFO L444 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,569 INFO L444 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-20 09:46:37,569 INFO L444 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-20 09:46:37,569 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-20 09:46:37,569 INFO L444 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-20 09:46:37,569 INFO L444 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-20 09:46:37,569 INFO L444 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-20 09:46:37,569 INFO L444 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,570 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,570 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,570 INFO L444 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,570 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-20 09:46:37,570 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-20 09:46:37,570 INFO L444 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,570 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-20 09:46:37,570 INFO L444 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,570 INFO L444 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,570 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,570 INFO L444 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,570 INFO L444 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,571 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,571 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-20 09:46:37,571 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 09:46:37,571 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-11-20 09:46:37,571 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,571 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,571 INFO L444 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,571 INFO L444 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,571 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,571 INFO L444 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-20 09:46:37,571 INFO L444 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-20 09:46:37,571 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,572 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-20 09:46:37,572 INFO L444 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-20 09:46:37,572 INFO L444 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-20 09:46:37,572 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,572 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-20 09:46:37,572 INFO L444 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-20 09:46:37,572 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,572 INFO L444 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,572 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,572 INFO L444 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,572 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-20 09:46:37,572 INFO L444 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-20 09:46:37,573 INFO L444 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,573 INFO L444 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,573 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,573 INFO L444 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-20 09:46:37,573 INFO L444 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-20 09:46:37,573 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,573 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-20 09:46:37,573 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,573 INFO L444 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,573 INFO L444 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,573 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,573 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,573 INFO L444 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,574 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-20 09:46:37,574 INFO L444 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,574 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,574 INFO L444 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-20 09:46:37,574 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,574 INFO L444 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,574 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,574 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,574 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-20 09:46:37,574 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,574 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,574 INFO L444 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,574 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,575 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,575 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-20 09:46:37,575 INFO L444 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,575 INFO L444 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,575 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,575 INFO L444 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,575 INFO L444 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-20 09:46:37,575 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,575 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,575 INFO L444 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,575 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-20 09:46:37,575 INFO L444 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-20 09:46:37,575 INFO L444 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,575 INFO L444 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,576 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-20 09:46:37,576 INFO L444 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,576 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,576 INFO L444 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,576 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,576 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,576 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-20 09:46:37,576 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,576 INFO L444 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,576 INFO L444 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,576 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,576 INFO L444 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,577 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-20 09:46:37,577 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,577 INFO L444 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,577 INFO L444 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-20 09:46:37,577 INFO L444 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,577 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-20 09:46:37,577 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-20 09:46:37,577 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,577 INFO L444 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,577 INFO L444 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,577 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,577 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,577 INFO L444 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-20 09:46:37,577 INFO L444 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-20 09:46:37,578 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,578 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-20 09:46:37,578 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 09:46:37,578 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-20 09:46:37,578 INFO L444 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,578 INFO L444 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,578 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,578 INFO L444 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,578 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,578 INFO L444 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-20 09:46:37,578 INFO L444 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-20 09:46:37,578 INFO L444 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-20 09:46:37,578 INFO L444 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-20 09:46:37,579 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,579 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,579 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,579 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-20 09:46:37,579 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-20 09:46:37,579 INFO L444 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,579 INFO L444 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-20 09:46:37,579 INFO L444 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,579 INFO L444 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,579 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,579 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,579 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-20 09:46:37,579 INFO L444 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-20 09:46:37,580 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-20 09:46:37,580 INFO L444 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,580 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-20 09:46:37,580 INFO L444 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,580 INFO L444 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,580 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,580 INFO L444 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,580 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,581 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,581 INFO L444 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,581 INFO L444 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,581 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-20 09:46:37,581 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-20 09:46:37,581 INFO L444 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-20 09:46:37,582 INFO L444 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-20 09:46:37,582 INFO L444 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,582 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,582 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,582 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,583 INFO L440 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse36 (+ ~a0~0 98)) (.cse39 (+ ~a4~0 86)) (.cse30 (= 3 ~a2~0))) (let ((.cse38 (+ ~a0~0 147)) (.cse37 (<= 0 (+ ~a0~0 44))) (.cse3 (not .cse30)) (.cse15 (<= .cse39 0)) (.cse0 (<= .cse36 0)) (.cse17 (+ ~a29~0 16))) (let ((.cse22 (<= (+ ~a0~0 155) 0)) (.cse9 (<= .cse17 0)) (.cse25 (= 1 ~a2~0)) (.cse6 (< 0 .cse39)) (.cse2 (not (= 4 ~a2~0))) (.cse33 (or .cse15 .cse0)) (.cse21 (or (and .cse37 .cse3) (and .cse15 .cse3))) (.cse8 (= 2 ~a2~0)) (.cse7 (<= .cse38 0)) (.cse5 (< 43 ~a29~0)) (.cse26 (<= (+ ~a0~0 148) 0)) (.cse19 (<= 0 (+ ~a29~0 192415))) (.cse4 (<= 3 ~a2~0)) (.cse14 (<= ~a2~0 4))) (let ((.cse10 (not (= 2 ULTIMATE.start_calculate_output_~input))) (.cse11 (not (= 2 ULTIMATE.start_calculate_output2_~input))) (.cse23 (or (and .cse7 .cse3 .cse5 .cse4 .cse14) (and .cse26 (and .cse3 .cse19 .cse4) .cse14))) (.cse27 (or .cse15 .cse7 .cse8)) (.cse31 (and .cse33 .cse21 .cse8)) (.cse20 (or (and .cse6 .cse26 (<= (+ ~a29~0 127) 0) .cse3 .cse4 .cse14) (and .cse26 (and .cse6 .cse2 .cse5 .cse4) .cse14))) (.cse29 (and .cse6 .cse25 .cse33)) (.cse28 (or .cse22 .cse9)) (.cse13 (< 0 .cse38)) (.cse12 (<= (+ ~a0~0 99) 0)) (.cse35 (and .cse21 .cse5 .cse4)) (.cse18 (<= ~a29~0 41)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse24 (or (and .cse25 .cse37) (and .cse15 .cse25))) (.cse16 (<= ~a29~0 43)) (.cse32 (<= (* 5 ~a0~0) (+ ~a29~0 551659))) (.cse34 (or .cse7 .cse30 (< 0 .cse36)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 (and .cse6 .cse7 .cse8)) (and (or .cse9 .cse10) .cse1 .cse11 .cse12 .cse13 .cse2 .cse4 .cse14) (and .cse15 .cse16 (or (< 0 .cse17) .cse0) .cse4) (and .cse8 .cse5 .cse1 .cse12 (<= ~a29~0 599998)) (and .cse10 .cse0 .cse18 .cse11 .cse8 .cse1 .cse19) (and (and .cse1 .cse20) .cse5) (and .cse1 (and .cse18 (and .cse21 .cse2 .cse19 .cse4))) (and .cse1 .cse22 .cse23) (and (<= ~a29~0 280462) .cse12 .cse24 .cse5) (and .cse1 (and .cse7 .cse2 .cse3 .cse19 .cse4)) (and .cse5 .cse1 .cse25 .cse26) (and .cse16 .cse27 (and (and .cse21 .cse4) .cse14)) (and .cse1 .cse13 .cse28 .cse29) (and (and .cse1 .cse23) .cse5) (and .cse13 .cse28 .cse1 .cse25 .cse19) (and (and .cse1 .cse27 .cse30) .cse16) (and .cse24 .cse7) (and (exists ((v_~a29~0_900 Int)) (and (<= ~a29~0 (+ (mod v_~a29~0_900 299978) 300021)) (< 43 v_~a29~0_900) (<= 0 v_~a29~0_900))) .cse31) (and .cse26 .cse31) (and .cse1 .cse22 .cse32 .cse20) (and (and .cse15 .cse13) .cse30) (and (and .cse1 .cse12 .cse29) .cse13 .cse16) (and (and .cse33 .cse24) .cse28) (and .cse18 .cse1 (and .cse0 .cse13 .cse2 .cse3 .cse4) .cse32) (and .cse15 .cse34 .cse35) (and .cse12 .cse35) (and .cse18 .cse1 .cse6 .cse25 (< 0 (+ ~a29~0 144))) (and (and (and .cse24 .cse16) .cse33) .cse32 .cse34)))))) [2019-11-20 09:46:37,583 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-20 09:46:37,584 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-20 09:46:37,584 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,584 INFO L444 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,584 INFO L444 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,584 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,584 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,585 INFO L444 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,585 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,585 INFO L444 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-20 09:46:37,585 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,585 INFO L444 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-20 09:46:37,585 INFO L447 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-20 09:46:37,586 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,586 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-20 09:46:37,586 INFO L444 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-20 09:46:37,586 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-20 09:46:37,586 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-20 09:46:37,586 INFO L444 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,587 INFO L444 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,587 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,587 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,587 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,587 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-20 09:46:37,587 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-20 09:46:37,588 INFO L444 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,588 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-20 09:46:37,588 INFO L444 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-20 09:46:37,588 INFO L444 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,588 INFO L444 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,588 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,589 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,589 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,589 INFO L444 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,590 INFO L440 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse36 (+ ~a0~0 98)) (.cse38 (+ ~a4~0 86)) (.cse18 (= 3 ~a2~0))) (let ((.cse37 (<= 0 (+ ~a0~0 44))) (.cse28 (not .cse18)) (.cse22 (<= .cse38 0)) (.cse24 (<= .cse36 0)) (.cse39 (+ ~a0~0 147)) (.cse40 (+ ~a29~0 16))) (let ((.cse20 (<= (+ ~a0~0 155) 0)) (.cse15 (<= .cse40 0)) (.cse11 (= 1 ~a2~0)) (.cse19 (< 0 .cse39)) (.cse23 (< 0 .cse40)) (.cse4 (or .cse22 .cse24)) (.cse5 (or (and .cse37 .cse28) (and .cse22 .cse28))) (.cse32 (<= 0 (+ ~a29~0 192415))) (.cse33 (<= 4 ~a2~0)) (.cse9 (<= .cse39 0)) (.cse6 (= 2 ~a2~0)) (.cse8 (< 0 .cse38)) (.cse27 (not (= 4 ~a2~0))) (.cse2 (< 43 ~a29~0)) (.cse12 (<= 3 ~a2~0)) (.cse25 (<= (+ ~a0~0 148) 0)) (.cse13 (<= ~a2~0 4))) (let ((.cse1 (or (and .cse25 (<= (+ ~a29~0 127) 0) .cse28 .cse12 .cse13) (and (and .cse8 .cse27 .cse2 .cse12) .cse25 .cse13))) (.cse14 (or .cse22 .cse9 .cse6)) (.cse7 (or (and .cse9 .cse28 .cse2 .cse12 .cse13) (and (and .cse8 .cse32) .cse33 .cse25 .cse13))) (.cse3 (<= ~a29~0 43)) (.cse21 (<= (* 5 ~a0~0) (+ ~a29~0 551659))) (.cse26 (and (or .cse24 .cse23) .cse4 .cse5 .cse6)) (.cse30 (and .cse8 .cse11 .cse4 .cse19)) (.cse16 (not (= 2 ULTIMATE.start_calculate_output_~input))) (.cse10 (<= ~a29~0 41)) (.cse34 (or .cse20 .cse15)) (.cse29 (or (and .cse11 .cse37) (and .cse22 .cse11))) (.cse31 (or .cse9 .cse18 (< 0 .cse36))) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse17 (<= (+ ~a0~0 99) 0)) (.cse35 (and .cse5 .cse2 .cse12))) (or (and (and .cse0 .cse1) .cse2) (and .cse3 (and .cse4 .cse5 .cse6)) (and (and .cse7 .cse0) .cse2) (and .cse0 (and .cse8 .cse9 .cse6)) (and .cse0 .cse10 .cse8 .cse11 (< 0 (+ ~a29~0 144))) (and .cse10 (and (and .cse5 .cse12) .cse13) .cse14) (and (and (or .cse15 .cse16) .cse0 .cse17 .cse18) .cse19) (and .cse0 .cse20 .cse1 .cse21) (and .cse22 .cse3 (or .cse23 .cse24) .cse12) (and .cse25 .cse26) (and (and .cse22 .cse19) .cse18) (and .cse10 .cse0 (and .cse8 .cse19 .cse4 .cse27 .cse28 .cse12) .cse21) (and (and .cse0 (and .cse4 .cse27 .cse28 .cse12)) .cse2) (and .cse3 (and .cse0 .cse14 .cse18)) (and .cse0 .cse20 .cse7) (and (and .cse0 .cse17) (<= ~a29~0 599998) .cse6 .cse2) (and (<= ~a29~0 280462) .cse17 .cse29 .cse2) (and (and .cse0 .cse17 .cse30) .cse3) (and .cse2 .cse0 .cse11 .cse25) (and (and (and .cse29 .cse3) .cse4) .cse21 .cse31) (and .cse0 (and (and .cse5 .cse27 .cse32) .cse10 .cse33)) (and .cse26 (exists ((v_~a29~0_900 Int)) (and (<= ~a29~0 (+ (mod v_~a29~0_900 299978) 300021)) (< 43 v_~a29~0_900) (<= 0 v_~a29~0_900)))) (and .cse19 .cse34 .cse0 .cse11 .cse32) (and .cse0 .cse30 .cse34) (and .cse0 (or (and .cse16 .cse10 .cse4 .cse6 .cse32) (and .cse10 .cse23 .cse4 .cse6))) (and (and .cse4 .cse29) .cse34) (and .cse9 .cse29) (and .cse22 .cse31 .cse35) (and .cse0 (and .cse9 .cse27 .cse28 .cse12 .cse32)) (and .cse17 .cse35)))))) [2019-11-20 09:46:37,590 INFO L444 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,590 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-20 09:46:37,590 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-20 09:46:37,591 INFO L444 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,591 INFO L444 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,591 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,591 INFO L444 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,591 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,591 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,592 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-20 09:46:37,592 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-20 09:46:37,592 INFO L444 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,592 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,592 INFO L444 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-20 09:46:37,592 INFO L444 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,593 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,593 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,593 INFO L444 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,593 INFO L444 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,593 INFO L444 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,593 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-20 09:46:37,594 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-20 09:46:37,594 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,594 INFO L444 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,594 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,594 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,594 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,595 INFO L444 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,595 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 09:46:37,595 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-20 09:46:37,595 INFO L444 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,595 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-20 09:46:37,595 INFO L444 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,596 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,596 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,596 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,596 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,596 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,596 INFO L444 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,597 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-20 09:46:37,597 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-20 09:46:37,597 INFO L444 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,597 INFO L444 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,597 INFO L444 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,597 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,598 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,598 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,598 INFO L444 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,598 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-20 09:46:37,598 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-20 09:46:37,598 INFO L444 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,599 INFO L444 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,599 INFO L444 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,599 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,599 INFO L444 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,599 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,599 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,600 INFO L444 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-20 09:46:37,600 INFO L444 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-20 09:46:37,600 INFO L444 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,600 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-20 09:46:37,600 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-20 09:46:37,600 INFO L444 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,600 INFO L444 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,601 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,601 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,601 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,601 INFO L444 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,602 INFO L440 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse36 (+ ~a0~0 98)) (.cse38 (+ ~a4~0 86)) (.cse18 (= 3 ~a2~0))) (let ((.cse37 (<= 0 (+ ~a0~0 44))) (.cse28 (not .cse18)) (.cse22 (<= .cse38 0)) (.cse24 (<= .cse36 0)) (.cse39 (+ ~a0~0 147)) (.cse40 (+ ~a29~0 16))) (let ((.cse20 (<= (+ ~a0~0 155) 0)) (.cse15 (<= .cse40 0)) (.cse11 (= 1 ~a2~0)) (.cse19 (< 0 .cse39)) (.cse23 (< 0 .cse40)) (.cse4 (or .cse22 .cse24)) (.cse5 (or (and .cse37 .cse28) (and .cse22 .cse28))) (.cse32 (<= 0 (+ ~a29~0 192415))) (.cse33 (<= 4 ~a2~0)) (.cse9 (<= .cse39 0)) (.cse6 (= 2 ~a2~0)) (.cse8 (< 0 .cse38)) (.cse27 (not (= 4 ~a2~0))) (.cse2 (< 43 ~a29~0)) (.cse12 (<= 3 ~a2~0)) (.cse25 (<= (+ ~a0~0 148) 0)) (.cse13 (<= ~a2~0 4))) (let ((.cse1 (or (and .cse25 (<= (+ ~a29~0 127) 0) .cse28 .cse12 .cse13) (and (and .cse8 .cse27 .cse2 .cse12) .cse25 .cse13))) (.cse14 (or .cse22 .cse9 .cse6)) (.cse7 (or (and .cse9 .cse28 .cse2 .cse12 .cse13) (and (and .cse8 .cse32) .cse33 .cse25 .cse13))) (.cse3 (<= ~a29~0 43)) (.cse21 (<= (* 5 ~a0~0) (+ ~a29~0 551659))) (.cse26 (and (or .cse24 .cse23) .cse4 .cse5 .cse6)) (.cse30 (and .cse8 .cse11 .cse4 .cse19)) (.cse16 (not (= 2 ULTIMATE.start_calculate_output_~input))) (.cse10 (<= ~a29~0 41)) (.cse34 (or .cse20 .cse15)) (.cse29 (or (and .cse11 .cse37) (and .cse22 .cse11))) (.cse31 (or .cse9 .cse18 (< 0 .cse36))) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse17 (<= (+ ~a0~0 99) 0)) (.cse35 (and .cse5 .cse2 .cse12))) (or (and (and .cse0 .cse1) .cse2) (and .cse3 (and .cse4 .cse5 .cse6)) (and (and .cse7 .cse0) .cse2) (and .cse0 (and .cse8 .cse9 .cse6)) (and .cse0 .cse10 .cse8 .cse11 (< 0 (+ ~a29~0 144))) (and .cse10 (and (and .cse5 .cse12) .cse13) .cse14) (and (and (or .cse15 .cse16) .cse0 .cse17 .cse18) .cse19) (and .cse0 .cse20 .cse1 .cse21) (and .cse22 .cse3 (or .cse23 .cse24) .cse12) (and .cse25 .cse26) (and (and .cse22 .cse19) .cse18) (and .cse10 .cse0 (and .cse8 .cse19 .cse4 .cse27 .cse28 .cse12) .cse21) (and (and .cse0 (and .cse4 .cse27 .cse28 .cse12)) .cse2) (and .cse3 (and .cse0 .cse14 .cse18)) (and .cse0 .cse20 .cse7) (and (and .cse0 .cse17) (<= ~a29~0 599998) .cse6 .cse2) (and (<= ~a29~0 280462) .cse17 .cse29 .cse2) (and (and .cse0 .cse17 .cse30) .cse3) (and .cse2 .cse0 .cse11 .cse25) (and (and (and .cse29 .cse3) .cse4) .cse21 .cse31) (and .cse0 (and (and .cse5 .cse27 .cse32) .cse10 .cse33)) (and .cse26 (exists ((v_~a29~0_900 Int)) (and (<= ~a29~0 (+ (mod v_~a29~0_900 299978) 300021)) (< 43 v_~a29~0_900) (<= 0 v_~a29~0_900)))) (and .cse19 .cse34 .cse0 .cse11 .cse32) (and .cse0 .cse30 .cse34) (and .cse0 (or (and .cse16 .cse10 .cse4 .cse6 .cse32) (and .cse10 .cse23 .cse4 .cse6))) (and (and .cse4 .cse29) .cse34) (and .cse9 .cse29) (and .cse22 .cse31 .cse35) (and .cse0 (and .cse9 .cse27 .cse28 .cse12 .cse32)) (and .cse17 .cse35)))))) [2019-11-20 09:46:37,602 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-20 09:46:37,602 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-20 09:46:37,603 INFO L444 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,603 INFO L444 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,603 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,603 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,603 INFO L444 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,603 INFO L444 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,604 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,604 INFO L444 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,604 INFO L444 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-20 09:46:37,604 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-20 09:46:37,604 INFO L444 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,604 INFO L444 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-20 09:46:37,605 INFO L444 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-20 09:46:37,605 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,605 INFO L444 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,605 INFO L444 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,605 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,605 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,606 INFO L444 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-20 09:46:37,606 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-20 09:46:37,606 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,606 INFO L444 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,606 INFO L444 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,606 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,607 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-20 09:46:37,607 INFO L444 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-20 09:46:37,607 INFO L444 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-20 09:46:37,607 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,607 INFO L444 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-20 09:46:37,607 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-20 09:46:37,608 INFO L444 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,608 INFO L444 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,608 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,608 INFO L444 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,608 INFO L444 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,608 INFO L444 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,609 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,609 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-20 09:46:37,609 INFO L444 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-20 09:46:37,609 INFO L444 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,609 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,609 INFO L444 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,609 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-20 09:46:37,610 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,610 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 09:46:37,610 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,610 INFO L444 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-20 09:46:37,610 INFO L444 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,610 INFO L444 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,611 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,611 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,611 INFO L444 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,611 INFO L444 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,611 INFO L444 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,611 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-20 09:46:37,612 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-20 09:46:37,612 INFO L444 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,612 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-20 09:46:37,612 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,612 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,612 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,613 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-20 09:46:37,613 INFO L444 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,613 INFO L444 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,613 INFO L444 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,613 INFO L444 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,613 INFO L444 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-20 09:46:37,613 INFO L444 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,614 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,614 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-20 09:46:37,614 INFO L444 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-20 09:46:37,614 INFO L444 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,614 INFO L444 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,614 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,615 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-20 09:46:37,615 INFO L444 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,615 INFO L444 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,615 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,615 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,615 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,616 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-20 09:46:37,616 INFO L444 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,616 INFO L444 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,616 INFO L444 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-20 09:46:37,616 INFO L444 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-20 09:46:37,617 INFO L444 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,617 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 09:46:37,617 INFO L444 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-20 09:46:37,617 INFO L444 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,617 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 09:46:37,617 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,618 INFO L444 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-20 09:46:37,618 INFO L444 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-20 09:46:37,618 INFO L444 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,618 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,618 INFO L444 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-20 09:46:37,618 INFO L444 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-20 09:46:37,618 INFO L444 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-20 09:46:37,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:37,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:37,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:37,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:37,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:37,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:37,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:37,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:37,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:37,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:37,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:37,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:37,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:37,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:37,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:37,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:37,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:37,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:37,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:46:37 BoogieIcfgContainer [2019-11-20 09:46:37,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 09:46:37,696 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 09:46:37,696 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 09:46:37,697 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 09:46:37,697 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:41:24" (3/4) ... [2019-11-20 09:46:37,701 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 09:46:37,759 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-20 09:46:37,763 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 09:46:37,798 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((a4 + 42 <= 0 && (((((a0 + 148 <= 0 && a29 + 127 <= 0) && !(3 == a2)) && 3 <= a2) && a2 <= 4) || (((((0 < a4 + 86 && !(4 == a2)) && 43 < a29) && 3 <= a2) && a0 + 148 <= 0) && a2 <= 4))) && 43 < a29) || (a29 <= 43 && ((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2)) || (((((((a0 + 147 <= 0 && !(3 == a2)) && 43 < a29) && 3 <= a2) && a2 <= 4) || ((((0 < a4 + 86 && 0 <= a29 + 192415) && 4 <= a2) && a0 + 148 <= 0) && a2 <= 4)) && a4 + 42 <= 0) && 43 < a29)) || (a4 + 42 <= 0 && (0 < a4 + 86 && a0 + 147 <= 0) && 2 == a2)) || ((((a4 + 42 <= 0 && a29 <= 41) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144)) || ((a29 <= 41 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 3 <= a2) && a2 <= 4) && ((a4 + 86 <= 0 || a0 + 147 <= 0) || 2 == a2))) || (((((a29 + 16 <= 0 || !(2 == input)) && a4 + 42 <= 0) && a0 + 99 <= 0) && 3 == a2) && 0 < a0 + 147)) || (((a4 + 42 <= 0 && a0 + 155 <= 0) && (((((a0 + 148 <= 0 && a29 + 127 <= 0) && !(3 == a2)) && 3 <= a2) && a2 <= 4) || (((((0 < a4 + 86 && !(4 == a2)) && 43 < a29) && 3 <= a2) && a0 + 148 <= 0) && a2 <= 4))) && 5 * a0 <= a29 + 551659)) || (((a4 + 86 <= 0 && a29 <= 43) && (0 < a29 + 16 || a0 + 98 <= 0)) && 3 <= a2)) || (a0 + 148 <= 0 && (((a0 + 98 <= 0 || 0 < a29 + 16) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 147) && 3 == a2)) || (((a29 <= 41 && a4 + 42 <= 0) && ((((0 < a4 + 86 && 0 < a0 + 147) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 5 * a0 <= a29 + 551659)) || ((a4 + 42 <= 0 && (((a4 + 86 <= 0 || a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 43 < a29)) || (a29 <= 43 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 || a0 + 147 <= 0) || 2 == a2)) && 3 == a2)) || ((a4 + 42 <= 0 && a0 + 155 <= 0) && (((((a0 + 147 <= 0 && !(3 == a2)) && 43 < a29) && 3 <= a2) && a2 <= 4) || ((((0 < a4 + 86 && 0 <= a29 + 192415) && 4 <= a2) && a0 + 148 <= 0) && a2 <= 4)))) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 <= 599998) && 2 == a2) && 43 < a29)) || (((a29 <= 280462 && a0 + 99 <= 0) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 43 < a29)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && ((0 < a4 + 86 && 1 == a2) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 < a0 + 147) && a29 <= 43)) || (((43 < a29 && a4 + 42 <= 0) && 1 == a2) && a0 + 148 <= 0)) || ((((((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a29 <= 43) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 5 * a0 <= a29 + 551659) && ((a0 + 147 <= 0 || 3 == a2) || 0 < a0 + 98))) || (a4 + 42 <= 0 && (((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && !(4 == a2)) && 0 <= a29 + 192415) && a29 <= 41) && 4 <= a2)) || (((((a0 + 98 <= 0 || 0 < a29 + 16) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && (\exists v_~a29~0_900 : int :: (a29 <= v_~a29~0_900 % 299978 + 300021 && 43 < v_~a29~0_900) && 0 <= v_~a29~0_900))) || ((((0 < a0 + 147 && (a0 + 155 <= 0 || a29 + 16 <= 0)) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 192415)) || ((a4 + 42 <= 0 && ((0 < a4 + 86 && 1 == a2) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 < a0 + 147) && (a0 + 155 <= 0 || a29 + 16 <= 0))) || (a4 + 42 <= 0 && (((((!(2 == input) && a29 <= 41) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 2 == a2) && 0 <= a29 + 192415) || (((a29 <= 41 && 0 < a29 + 16) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 2 == a2)))) || (((a4 + 86 <= 0 || a0 + 98 <= 0) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && (a0 + 155 <= 0 || a29 + 16 <= 0))) || (a0 + 147 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)))) || ((a4 + 86 <= 0 && ((a0 + 147 <= 0 || 3 == a2) || 0 < a0 + 98)) && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 43 < a29) && 3 <= a2)) || (a4 + 42 <= 0 && (((a0 + 147 <= 0 && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 0 <= a29 + 192415)) || (a0 + 99 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 43 < a29) && 3 <= a2) [2019-11-20 09:46:37,802 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((a4 + 42 <= 0 && (((((a0 + 148 <= 0 && a29 + 127 <= 0) && !(3 == a2)) && 3 <= a2) && a2 <= 4) || (((((0 < a4 + 86 && !(4 == a2)) && 43 < a29) && 3 <= a2) && a0 + 148 <= 0) && a2 <= 4))) && 43 < a29) || (a29 <= 43 && ((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2)) || (((((((a0 + 147 <= 0 && !(3 == a2)) && 43 < a29) && 3 <= a2) && a2 <= 4) || ((((0 < a4 + 86 && 0 <= a29 + 192415) && 4 <= a2) && a0 + 148 <= 0) && a2 <= 4)) && a4 + 42 <= 0) && 43 < a29)) || (a4 + 42 <= 0 && (0 < a4 + 86 && a0 + 147 <= 0) && 2 == a2)) || ((((a4 + 42 <= 0 && a29 <= 41) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144)) || ((a29 <= 41 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 3 <= a2) && a2 <= 4) && ((a4 + 86 <= 0 || a0 + 147 <= 0) || 2 == a2))) || (((((a29 + 16 <= 0 || !(2 == input)) && a4 + 42 <= 0) && a0 + 99 <= 0) && 3 == a2) && 0 < a0 + 147)) || (((a4 + 42 <= 0 && a0 + 155 <= 0) && (((((a0 + 148 <= 0 && a29 + 127 <= 0) && !(3 == a2)) && 3 <= a2) && a2 <= 4) || (((((0 < a4 + 86 && !(4 == a2)) && 43 < a29) && 3 <= a2) && a0 + 148 <= 0) && a2 <= 4))) && 5 * a0 <= a29 + 551659)) || (((a4 + 86 <= 0 && a29 <= 43) && (0 < a29 + 16 || a0 + 98 <= 0)) && 3 <= a2)) || (a0 + 148 <= 0 && (((a0 + 98 <= 0 || 0 < a29 + 16) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 147) && 3 == a2)) || (((a29 <= 41 && a4 + 42 <= 0) && ((((0 < a4 + 86 && 0 < a0 + 147) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 5 * a0 <= a29 + 551659)) || ((a4 + 42 <= 0 && (((a4 + 86 <= 0 || a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 43 < a29)) || (a29 <= 43 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 || a0 + 147 <= 0) || 2 == a2)) && 3 == a2)) || ((a4 + 42 <= 0 && a0 + 155 <= 0) && (((((a0 + 147 <= 0 && !(3 == a2)) && 43 < a29) && 3 <= a2) && a2 <= 4) || ((((0 < a4 + 86 && 0 <= a29 + 192415) && 4 <= a2) && a0 + 148 <= 0) && a2 <= 4)))) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 <= 599998) && 2 == a2) && 43 < a29)) || (((a29 <= 280462 && a0 + 99 <= 0) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 43 < a29)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && ((0 < a4 + 86 && 1 == a2) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 < a0 + 147) && a29 <= 43)) || (((43 < a29 && a4 + 42 <= 0) && 1 == a2) && a0 + 148 <= 0)) || ((((((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a29 <= 43) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 5 * a0 <= a29 + 551659) && ((a0 + 147 <= 0 || 3 == a2) || 0 < a0 + 98))) || (a4 + 42 <= 0 && (((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && !(4 == a2)) && 0 <= a29 + 192415) && a29 <= 41) && 4 <= a2)) || (((((a0 + 98 <= 0 || 0 < a29 + 16) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && (\exists v_~a29~0_900 : int :: (a29 <= v_~a29~0_900 % 299978 + 300021 && 43 < v_~a29~0_900) && 0 <= v_~a29~0_900))) || ((((0 < a0 + 147 && (a0 + 155 <= 0 || a29 + 16 <= 0)) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 192415)) || ((a4 + 42 <= 0 && ((0 < a4 + 86 && 1 == a2) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 < a0 + 147) && (a0 + 155 <= 0 || a29 + 16 <= 0))) || (a4 + 42 <= 0 && (((((!(2 == input) && a29 <= 41) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 2 == a2) && 0 <= a29 + 192415) || (((a29 <= 41 && 0 < a29 + 16) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 2 == a2)))) || (((a4 + 86 <= 0 || a0 + 98 <= 0) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && (a0 + 155 <= 0 || a29 + 16 <= 0))) || (a0 + 147 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)))) || ((a4 + 86 <= 0 && ((a0 + 147 <= 0 || 3 == a2) || 0 < a0 + 98)) && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 43 < a29) && 3 <= a2)) || (a4 + 42 <= 0 && (((a0 + 147 <= 0 && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 0 <= a29 + 192415)) || (a0 + 99 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 43 < a29) && 3 <= a2) [2019-11-20 09:46:37,815 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 43 < a29) || (a4 + 42 <= 0 && (0 < a4 + 86 && a0 + 147 <= 0) && 2 == a2)) || ((((((((a29 + 16 <= 0 || !(2 == input)) && a4 + 42 <= 0) && !(2 == input)) && a0 + 99 <= 0) && 0 < a0 + 147) && !(4 == a2)) && 3 <= a2) && a2 <= 4)) || (((a4 + 86 <= 0 && a29 <= 43) && (0 < a29 + 16 || a0 + 98 <= 0)) && 3 <= a2)) || ((((2 == a2 && 43 < a29) && a4 + 42 <= 0) && a0 + 99 <= 0) && a29 <= 599998)) || ((((((!(2 == input) && a0 + 98 <= 0) && a29 <= 41) && !(2 == input)) && 2 == a2) && a4 + 42 <= 0) && 0 <= a29 + 192415)) || ((a4 + 42 <= 0 && ((((((0 < a4 + 86 && a0 + 148 <= 0) && a29 + 127 <= 0) && !(3 == a2)) && 3 <= a2) && a2 <= 4) || ((a0 + 148 <= 0 && ((0 < a4 + 86 && !(4 == a2)) && 43 < a29) && 3 <= a2) && a2 <= 4))) && 43 < a29)) || (a4 + 42 <= 0 && a29 <= 41 && ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && !(4 == a2)) && 0 <= a29 + 192415) && 3 <= a2)) || ((a4 + 42 <= 0 && a0 + 155 <= 0) && (((((a0 + 147 <= 0 && !(3 == a2)) && 43 < a29) && 3 <= a2) && a2 <= 4) || ((a0 + 148 <= 0 && (!(3 == a2) && 0 <= a29 + 192415) && 3 <= a2) && a2 <= 4)))) || (((a29 <= 280462 && a0 + 99 <= 0) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 43 < a29)) || (a4 + 42 <= 0 && (((a0 + 147 <= 0 && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 192415) && 3 <= a2)) || (((43 < a29 && a4 + 42 <= 0) && 1 == a2) && a0 + 148 <= 0)) || ((a29 <= 43 && ((a4 + 86 <= 0 || a0 + 147 <= 0) || 2 == a2)) && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 3 <= a2) && a2 <= 4)) || (((a4 + 42 <= 0 && 0 < a0 + 147) && (a0 + 155 <= 0 || a29 + 16 <= 0)) && (0 < a4 + 86 && 1 == a2) && (a4 + 86 <= 0 || a0 + 98 <= 0))) || ((a4 + 42 <= 0 && (((((a0 + 147 <= 0 && !(3 == a2)) && 43 < a29) && 3 <= a2) && a2 <= 4) || ((a0 + 148 <= 0 && (!(3 == a2) && 0 <= a29 + 192415) && 3 <= a2) && a2 <= 4))) && 43 < a29)) || ((((0 < a0 + 147 && (a0 + 155 <= 0 || a29 + 16 <= 0)) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 192415)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 || a0 + 147 <= 0) || 2 == a2)) && 3 == a2) && a29 <= 43)) || (((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a0 + 147 <= 0)) || ((\exists v_~a29~0_900 : int :: (a29 <= v_~a29~0_900 % 299978 + 300021 && 43 < v_~a29~0_900) && 0 <= v_~a29~0_900) && ((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2)) || (a0 + 148 <= 0 && ((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2)) || (((a4 + 42 <= 0 && a0 + 155 <= 0) && 5 * a0 <= a29 + 551659) && ((((((0 < a4 + 86 && a0 + 148 <= 0) && a29 + 127 <= 0) && !(3 == a2)) && 3 <= a2) && a2 <= 4) || ((a0 + 148 <= 0 && ((0 < a4 + 86 && !(4 == a2)) && 43 < a29) && 3 <= a2) && a2 <= 4)))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && 3 == a2)) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && (0 < a4 + 86 && 1 == a2) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 < a0 + 147) && a29 <= 43)) || (((a4 + 86 <= 0 || a0 + 98 <= 0) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && (a0 + 155 <= 0 || a29 + 16 <= 0))) || (((a29 <= 41 && a4 + 42 <= 0) && (((a0 + 98 <= 0 && 0 < a0 + 147) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 5 * a0 <= a29 + 551659)) || ((a4 + 86 <= 0 && ((a0 + 147 <= 0 || 3 == a2) || 0 < a0 + 98)) && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 43 < a29) && 3 <= a2)) || (a0 + 99 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 43 < a29) && 3 <= a2)) || ((((a29 <= 41 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144)) || ((((((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a29 <= 43) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 5 * a0 <= a29 + 551659) && ((a0 + 147 <= 0 || 3 == a2) || 0 < a0 + 98)) [2019-11-20 09:46:38,089 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7f8aa639-6eb5-4919-b52d-c88ca8eb9fc7/bin/uautomizer/witness.graphml [2019-11-20 09:46:38,089 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 09:46:38,091 INFO L168 Benchmark]: Toolchain (without parser) took 318076.82 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 942.0 MB in the beginning and 1.6 GB in the end (delta: -614.5 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-11-20 09:46:38,091 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 09:46:38,092 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1255.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 942.0 MB in the beginning and 1.0 GB in the end (delta: -107.4 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2019-11-20 09:46:38,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 176.88 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.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. [2019-11-20 09:46:38,093 INFO L168 Benchmark]: Boogie Preprocessor took 173.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 986.7 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-20 09:46:38,093 INFO L168 Benchmark]: RCFGBuilder took 2961.40 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.8 MB). Free memory was 986.7 MB in the beginning and 1.1 GB in the end (delta: -144.5 MB). Peak memory consumption was 237.5 MB. Max. memory is 11.5 GB. [2019-11-20 09:46:38,094 INFO L168 Benchmark]: TraceAbstraction took 313111.95 ms. Allocated memory was 1.3 GB in the beginning and 4.8 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -450.9 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-11-20 09:46:38,094 INFO L168 Benchmark]: Witness Printer took 393.42 ms. Allocated memory is still 4.8 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-11-20 09:46:38,097 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1255.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 942.0 MB in the beginning and 1.0 GB in the end (delta: -107.4 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 176.88 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.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 173.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 986.7 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2961.40 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.8 MB). Free memory was 986.7 MB in the beginning and 1.1 GB in the end (delta: -144.5 MB). Peak memory consumption was 237.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 313111.95 ms. Allocated memory was 1.3 GB in the beginning and 4.8 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -450.9 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 393.42 ms. Allocated memory is still 4.8 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.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_~a29~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 109]: 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-20 09:46:38,106 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:38,106 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:38,107 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:38,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:38,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:38,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((a4 + 42 <= 0 && (((((a0 + 148 <= 0 && a29 + 127 <= 0) && !(3 == a2)) && 3 <= a2) && a2 <= 4) || (((((0 < a4 + 86 && !(4 == a2)) && 43 < a29) && 3 <= a2) && a0 + 148 <= 0) && a2 <= 4))) && 43 < a29) || (a29 <= 43 && ((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2)) || (((((((a0 + 147 <= 0 && !(3 == a2)) && 43 < a29) && 3 <= a2) && a2 <= 4) || ((((0 < a4 + 86 && 0 <= a29 + 192415) && 4 <= a2) && a0 + 148 <= 0) && a2 <= 4)) && a4 + 42 <= 0) && 43 < a29)) || (a4 + 42 <= 0 && (0 < a4 + 86 && a0 + 147 <= 0) && 2 == a2)) || ((((a4 + 42 <= 0 && a29 <= 41) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144)) || ((a29 <= 41 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 3 <= a2) && a2 <= 4) && ((a4 + 86 <= 0 || a0 + 147 <= 0) || 2 == a2))) || (((((a29 + 16 <= 0 || !(2 == input)) && a4 + 42 <= 0) && a0 + 99 <= 0) && 3 == a2) && 0 < a0 + 147)) || (((a4 + 42 <= 0 && a0 + 155 <= 0) && (((((a0 + 148 <= 0 && a29 + 127 <= 0) && !(3 == a2)) && 3 <= a2) && a2 <= 4) || (((((0 < a4 + 86 && !(4 == a2)) && 43 < a29) && 3 <= a2) && a0 + 148 <= 0) && a2 <= 4))) && 5 * a0 <= a29 + 551659)) || (((a4 + 86 <= 0 && a29 <= 43) && (0 < a29 + 16 || a0 + 98 <= 0)) && 3 <= a2)) || (a0 + 148 <= 0 && (((a0 + 98 <= 0 || 0 < a29 + 16) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 147) && 3 == a2)) || (((a29 <= 41 && a4 + 42 <= 0) && ((((0 < a4 + 86 && 0 < a0 + 147) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 5 * a0 <= a29 + 551659)) || ((a4 + 42 <= 0 && (((a4 + 86 <= 0 || a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 43 < a29)) || (a29 <= 43 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 || a0 + 147 <= 0) || 2 == a2)) && 3 == a2)) || ((a4 + 42 <= 0 && a0 + 155 <= 0) && (((((a0 + 147 <= 0 && !(3 == a2)) && 43 < a29) && 3 <= a2) && a2 <= 4) || ((((0 < a4 + 86 && 0 <= a29 + 192415) && 4 <= a2) && a0 + 148 <= 0) && a2 <= 4)))) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 <= 599998) && 2 == a2) && 43 < a29)) || (((a29 <= 280462 && a0 + 99 <= 0) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 43 < a29)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && ((0 < a4 + 86 && 1 == a2) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 < a0 + 147) && a29 <= 43)) || (((43 < a29 && a4 + 42 <= 0) && 1 == a2) && a0 + 148 <= 0)) || ((((((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a29 <= 43) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 5 * a0 <= a29 + 551659) && ((a0 + 147 <= 0 || 3 == a2) || 0 < a0 + 98))) || (a4 + 42 <= 0 && (((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && !(4 == a2)) && 0 <= a29 + 192415) && a29 <= 41) && 4 <= a2)) || (((((a0 + 98 <= 0 || 0 < a29 + 16) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && (\exists v_~a29~0_900 : int :: (a29 <= v_~a29~0_900 % 299978 + 300021 && 43 < v_~a29~0_900) && 0 <= v_~a29~0_900))) || ((((0 < a0 + 147 && (a0 + 155 <= 0 || a29 + 16 <= 0)) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 192415)) || ((a4 + 42 <= 0 && ((0 < a4 + 86 && 1 == a2) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 < a0 + 147) && (a0 + 155 <= 0 || a29 + 16 <= 0))) || (a4 + 42 <= 0 && (((((!(2 == input) && a29 <= 41) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 2 == a2) && 0 <= a29 + 192415) || (((a29 <= 41 && 0 < a29 + 16) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 2 == a2)))) || (((a4 + 86 <= 0 || a0 + 98 <= 0) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && (a0 + 155 <= 0 || a29 + 16 <= 0))) || (a0 + 147 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)))) || ((a4 + 86 <= 0 && ((a0 + 147 <= 0 || 3 == a2) || 0 < a0 + 98)) && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 43 < a29) && 3 <= a2)) || (a4 + 42 <= 0 && (((a0 + 147 <= 0 && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 0 <= a29 + 192415)) || (a0 + 99 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 43 < a29) && 3 <= a2) - InvariantResult [Line: 23]: Loop Invariant [2019-11-20 09:46:38,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:38,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:38,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:38,116 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:38,117 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:38,117 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((a4 + 42 <= 0 && (((((a0 + 148 <= 0 && a29 + 127 <= 0) && !(3 == a2)) && 3 <= a2) && a2 <= 4) || (((((0 < a4 + 86 && !(4 == a2)) && 43 < a29) && 3 <= a2) && a0 + 148 <= 0) && a2 <= 4))) && 43 < a29) || (a29 <= 43 && ((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2)) || (((((((a0 + 147 <= 0 && !(3 == a2)) && 43 < a29) && 3 <= a2) && a2 <= 4) || ((((0 < a4 + 86 && 0 <= a29 + 192415) && 4 <= a2) && a0 + 148 <= 0) && a2 <= 4)) && a4 + 42 <= 0) && 43 < a29)) || (a4 + 42 <= 0 && (0 < a4 + 86 && a0 + 147 <= 0) && 2 == a2)) || ((((a4 + 42 <= 0 && a29 <= 41) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144)) || ((a29 <= 41 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 3 <= a2) && a2 <= 4) && ((a4 + 86 <= 0 || a0 + 147 <= 0) || 2 == a2))) || (((((a29 + 16 <= 0 || !(2 == input)) && a4 + 42 <= 0) && a0 + 99 <= 0) && 3 == a2) && 0 < a0 + 147)) || (((a4 + 42 <= 0 && a0 + 155 <= 0) && (((((a0 + 148 <= 0 && a29 + 127 <= 0) && !(3 == a2)) && 3 <= a2) && a2 <= 4) || (((((0 < a4 + 86 && !(4 == a2)) && 43 < a29) && 3 <= a2) && a0 + 148 <= 0) && a2 <= 4))) && 5 * a0 <= a29 + 551659)) || (((a4 + 86 <= 0 && a29 <= 43) && (0 < a29 + 16 || a0 + 98 <= 0)) && 3 <= a2)) || (a0 + 148 <= 0 && (((a0 + 98 <= 0 || 0 < a29 + 16) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 147) && 3 == a2)) || (((a29 <= 41 && a4 + 42 <= 0) && ((((0 < a4 + 86 && 0 < a0 + 147) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 5 * a0 <= a29 + 551659)) || ((a4 + 42 <= 0 && (((a4 + 86 <= 0 || a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 43 < a29)) || (a29 <= 43 && (a4 + 42 <= 0 && ((a4 + 86 <= 0 || a0 + 147 <= 0) || 2 == a2)) && 3 == a2)) || ((a4 + 42 <= 0 && a0 + 155 <= 0) && (((((a0 + 147 <= 0 && !(3 == a2)) && 43 < a29) && 3 <= a2) && a2 <= 4) || ((((0 < a4 + 86 && 0 <= a29 + 192415) && 4 <= a2) && a0 + 148 <= 0) && a2 <= 4)))) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 <= 599998) && 2 == a2) && 43 < a29)) || (((a29 <= 280462 && a0 + 99 <= 0) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 43 < a29)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && ((0 < a4 + 86 && 1 == a2) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 < a0 + 147) && a29 <= 43)) || (((43 < a29 && a4 + 42 <= 0) && 1 == a2) && a0 + 148 <= 0)) || ((((((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a29 <= 43) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 5 * a0 <= a29 + 551659) && ((a0 + 147 <= 0 || 3 == a2) || 0 < a0 + 98))) || (a4 + 42 <= 0 && (((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && !(4 == a2)) && 0 <= a29 + 192415) && a29 <= 41) && 4 <= a2)) || (((((a0 + 98 <= 0 || 0 < a29 + 16) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && (\exists v_~a29~0_900 : int :: (a29 <= v_~a29~0_900 % 299978 + 300021 && 43 < v_~a29~0_900) && 0 <= v_~a29~0_900))) || ((((0 < a0 + 147 && (a0 + 155 <= 0 || a29 + 16 <= 0)) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 192415)) || ((a4 + 42 <= 0 && ((0 < a4 + 86 && 1 == a2) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 < a0 + 147) && (a0 + 155 <= 0 || a29 + 16 <= 0))) || (a4 + 42 <= 0 && (((((!(2 == input) && a29 <= 41) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 2 == a2) && 0 <= a29 + 192415) || (((a29 <= 41 && 0 < a29 + 16) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 2 == a2)))) || (((a4 + 86 <= 0 || a0 + 98 <= 0) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && (a0 + 155 <= 0 || a29 + 16 <= 0))) || (a0 + 147 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)))) || ((a4 + 86 <= 0 && ((a0 + 147 <= 0 || 3 == a2) || 0 < a0 + 98)) && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 43 < a29) && 3 <= a2)) || (a4 + 42 <= 0 && (((a0 + 147 <= 0 && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 0 <= a29 + 192415)) || (a0 + 99 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 43 < a29) && 3 <= a2) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-20 09:46:38,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:38,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:38,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:38,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:38,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] [2019-11-20 09:46:38,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_900,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 43 < a29) || (a4 + 42 <= 0 && (0 < a4 + 86 && a0 + 147 <= 0) && 2 == a2)) || ((((((((a29 + 16 <= 0 || !(2 == input)) && a4 + 42 <= 0) && !(2 == input)) && a0 + 99 <= 0) && 0 < a0 + 147) && !(4 == a2)) && 3 <= a2) && a2 <= 4)) || (((a4 + 86 <= 0 && a29 <= 43) && (0 < a29 + 16 || a0 + 98 <= 0)) && 3 <= a2)) || ((((2 == a2 && 43 < a29) && a4 + 42 <= 0) && a0 + 99 <= 0) && a29 <= 599998)) || ((((((!(2 == input) && a0 + 98 <= 0) && a29 <= 41) && !(2 == input)) && 2 == a2) && a4 + 42 <= 0) && 0 <= a29 + 192415)) || ((a4 + 42 <= 0 && ((((((0 < a4 + 86 && a0 + 148 <= 0) && a29 + 127 <= 0) && !(3 == a2)) && 3 <= a2) && a2 <= 4) || ((a0 + 148 <= 0 && ((0 < a4 + 86 && !(4 == a2)) && 43 < a29) && 3 <= a2) && a2 <= 4))) && 43 < a29)) || (a4 + 42 <= 0 && a29 <= 41 && ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && !(4 == a2)) && 0 <= a29 + 192415) && 3 <= a2)) || ((a4 + 42 <= 0 && a0 + 155 <= 0) && (((((a0 + 147 <= 0 && !(3 == a2)) && 43 < a29) && 3 <= a2) && a2 <= 4) || ((a0 + 148 <= 0 && (!(3 == a2) && 0 <= a29 + 192415) && 3 <= a2) && a2 <= 4)))) || (((a29 <= 280462 && a0 + 99 <= 0) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 43 < a29)) || (a4 + 42 <= 0 && (((a0 + 147 <= 0 && !(4 == a2)) && !(3 == a2)) && 0 <= a29 + 192415) && 3 <= a2)) || (((43 < a29 && a4 + 42 <= 0) && 1 == a2) && a0 + 148 <= 0)) || ((a29 <= 43 && ((a4 + 86 <= 0 || a0 + 147 <= 0) || 2 == a2)) && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 3 <= a2) && a2 <= 4)) || (((a4 + 42 <= 0 && 0 < a0 + 147) && (a0 + 155 <= 0 || a29 + 16 <= 0)) && (0 < a4 + 86 && 1 == a2) && (a4 + 86 <= 0 || a0 + 98 <= 0))) || ((a4 + 42 <= 0 && (((((a0 + 147 <= 0 && !(3 == a2)) && 43 < a29) && 3 <= a2) && a2 <= 4) || ((a0 + 148 <= 0 && (!(3 == a2) && 0 <= a29 + 192415) && 3 <= a2) && a2 <= 4))) && 43 < a29)) || ((((0 < a0 + 147 && (a0 + 155 <= 0 || a29 + 16 <= 0)) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 192415)) || (((a4 + 42 <= 0 && ((a4 + 86 <= 0 || a0 + 147 <= 0) || 2 == a2)) && 3 == a2) && a29 <= 43)) || (((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a0 + 147 <= 0)) || ((\exists v_~a29~0_900 : int :: (a29 <= v_~a29~0_900 % 299978 + 300021 && 43 < v_~a29~0_900) && 0 <= v_~a29~0_900) && ((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2)) || (a0 + 148 <= 0 && ((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2)) || (((a4 + 42 <= 0 && a0 + 155 <= 0) && 5 * a0 <= a29 + 551659) && ((((((0 < a4 + 86 && a0 + 148 <= 0) && a29 + 127 <= 0) && !(3 == a2)) && 3 <= a2) && a2 <= 4) || ((a0 + 148 <= 0 && ((0 < a4 + 86 && !(4 == a2)) && 43 < a29) && 3 <= a2) && a2 <= 4)))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && 3 == a2)) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && (0 < a4 + 86 && 1 == a2) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 < a0 + 147) && a29 <= 43)) || (((a4 + 86 <= 0 || a0 + 98 <= 0) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && (a0 + 155 <= 0 || a29 + 16 <= 0))) || (((a29 <= 41 && a4 + 42 <= 0) && (((a0 + 98 <= 0 && 0 < a0 + 147) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 5 * a0 <= a29 + 551659)) || ((a4 + 86 <= 0 && ((a0 + 147 <= 0 || 3 == a2) || 0 < a0 + 98)) && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 43 < a29) && 3 <= a2)) || (a0 + 99 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 43 < a29) && 3 <= a2)) || ((((a29 <= 41 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144)) || ((((((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)) && a29 <= 43) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 5 * a0 <= a29 + 551659) && ((a0 + 147 <= 0 || 3 == a2) || 0 < a0 + 98)) - 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: 312.9s, OverallIterations: 19, TraceHistogramMax: 7, AutomataDifference: 215.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 46.5s, HoareTripleCheckerStatistics: 4758 SDtfs, 87128 SDslu, 2976 SDs, 0 SdLazy, 147985 SolverSat, 15333 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 168.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9570 GetRequests, 9051 SyntacticMatches, 31 SemanticMatches, 488 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20123 ImplicationChecksByTransitivity, 22.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25785occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 68853 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 543 NumberOfFragments, 3417 HoareAnnotationTreeSize, 4 FomulaSimplifications, 2678687 FormulaSimplificationTreeSizeReduction, 10.6s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1446508 FormulaSimplificationTreeSizeReductionInter, 35.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 20.7s InterpolantComputationTime, 21253 NumberOfCodeBlocks, 21253 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 21222 ConstructedInterpolants, 574 QuantifiedInterpolants, 105399168 SizeOfPredicates, 28 NumberOfNonLiveVariables, 10302 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 31 InterpolantComputations, 15 PerfectInterpolantSequences, 23589/26427 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...