./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label10.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/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-cad4683 [2019-11-15 23:49:52,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:49:52,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:49:52,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:49:52,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:49:52,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:49:52,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:49:52,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:49:52,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:49:52,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:49:52,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:49:52,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:49:52,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:49:52,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:49:52,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:49:52,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:49:52,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:49:52,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:49:52,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:49:52,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:49:52,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:49:52,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:49:52,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:49:52,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:49:52,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:49:52,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:49:52,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:49:52,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:49:52,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:49:52,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:49:52,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:49:52,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:49:52,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:49:52,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:49:52,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:49:52,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:49:52,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:49:52,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:49:52,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:49:52,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:49:52,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:49:52,571 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:49:52,586 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:49:52,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:49:52,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:49:52,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:49:52,588 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:49:52,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:49:52,589 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:49:52,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:49:52,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:49:52,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:49:52,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:49:52,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:49:52,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:49:52,591 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:49:52,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:49:52,592 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:49:52,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:49:52,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:49:52,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:49:52,593 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:49:52,593 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:49:52,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:49:52,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:49:52,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:49:52,594 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:49:52,594 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:49:52,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:49:52,595 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:49:52,595 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_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/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-15 23:49:52,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:49:52,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:49:52,643 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:49:52,644 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:49:52,645 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:49:52,646 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label10.c [2019-11-15 23:49:52,708 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/bin/uautomizer/data/7f888623d/a6b6b00657dd4c888e9a7a0ebd74d78e/FLAG786fba82a [2019-11-15 23:49:53,304 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:49:53,305 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/sv-benchmarks/c/eca-rers2012/Problem15_label10.c [2019-11-15 23:49:53,326 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/bin/uautomizer/data/7f888623d/a6b6b00657dd4c888e9a7a0ebd74d78e/FLAG786fba82a [2019-11-15 23:49:53,520 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/bin/uautomizer/data/7f888623d/a6b6b00657dd4c888e9a7a0ebd74d78e [2019-11-15 23:49:53,523 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:49:53,525 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:49:53,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:49:53,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:49:53,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:49:53,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:49:53" (1/1) ... [2019-11-15 23:49:53,535 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302727f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:53, skipping insertion in model container [2019-11-15 23:49:53,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:49:53" (1/1) ... [2019-11-15 23:49:53,544 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:49:53,643 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:49:54,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:49:54,561 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:49:54,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:49:54,950 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:49:54,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:54 WrapperNode [2019-11-15 23:49:54,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:49:54,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:49:54,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:49:54,954 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:49:54,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:54" (1/1) ... [2019-11-15 23:49:55,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:54" (1/1) ... [2019-11-15 23:49:55,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:49:55,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:49:55,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:49:55,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:49:55,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:54" (1/1) ... [2019-11-15 23:49:55,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:54" (1/1) ... [2019-11-15 23:49:55,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:54" (1/1) ... [2019-11-15 23:49:55,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:54" (1/1) ... [2019-11-15 23:49:55,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:54" (1/1) ... [2019-11-15 23:49:55,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:54" (1/1) ... [2019-11-15 23:49:55,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:54" (1/1) ... [2019-11-15 23:49:55,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:49:55,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:49:55,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:49:55,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:49:55,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:49:55,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:49:55,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:49:58,864 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:49:58,864 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 23:49:58,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:49:58 BoogieIcfgContainer [2019-11-15 23:49:58,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:49:58,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:49:58,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:49:58,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:49:58,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:49:53" (1/3) ... [2019-11-15 23:49:58,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755cfb23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:49:58, skipping insertion in model container [2019-11-15 23:49:58,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:49:54" (2/3) ... [2019-11-15 23:49:58,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755cfb23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:49:58, skipping insertion in model container [2019-11-15 23:49:58,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:49:58" (3/3) ... [2019-11-15 23:49:58,879 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label10.c [2019-11-15 23:49:58,892 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:49:58,902 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:49:58,915 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:49:58,964 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:49:58,964 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:49:58,965 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:49:58,965 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:49:58,965 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:49:58,965 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:49:58,966 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:49:58,966 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:49:59,000 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-15 23:49:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 23:49:59,008 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:49:59,009 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:49:59,011 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:49:59,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:49:59,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1089129850, now seen corresponding path program 1 times [2019-11-15 23:49:59,028 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:49:59,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349567563] [2019-11-15 23:49:59,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:59,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:49:59,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:49:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:49:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:49:59,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349567563] [2019-11-15 23:49:59,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:49:59,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:49:59,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203046450] [2019-11-15 23:49:59,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:49:59,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:49:59,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:49:59,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:49:59,419 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-15 23:50:05,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:05,329 INFO L93 Difference]: Finished difference Result 1470 states and 2719 transitions. [2019-11-15 23:50:05,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:50:05,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-15 23:50:05,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:05,355 INFO L225 Difference]: With dead ends: 1470 [2019-11-15 23:50:05,355 INFO L226 Difference]: Without dead ends: 978 [2019-11-15 23:50:05,360 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-11-15 23:50:05,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2019-11-15 23:50:05,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-11-15 23:50:05,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1472 transitions. [2019-11-15 23:50:05,467 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1472 transitions. Word has length 34 [2019-11-15 23:50:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:05,468 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 1472 transitions. [2019-11-15 23:50:05,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:50:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1472 transitions. [2019-11-15 23:50:05,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 23:50:05,473 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:05,473 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:50:05,474 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:05,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:05,474 INFO L82 PathProgramCache]: Analyzing trace with hash 513841653, now seen corresponding path program 1 times [2019-11-15 23:50:05,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:05,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008543308] [2019-11-15 23:50:05,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:05,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:05,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:05,703 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-15 23:50:05,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008543308] [2019-11-15 23:50:05,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:05,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:50:05,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337750748] [2019-11-15 23:50:05,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:50:05,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:05,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:50:05,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:05,707 INFO L87 Difference]: Start difference. First operand 976 states and 1472 transitions. Second operand 4 states. [2019-11-15 23:50:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:11,059 INFO L93 Difference]: Finished difference Result 3753 states and 5688 transitions. [2019-11-15 23:50:11,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:50:11,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 23:50:11,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:11,079 INFO L225 Difference]: With dead ends: 3753 [2019-11-15 23:50:11,079 INFO L226 Difference]: Without dead ends: 2779 [2019-11-15 23:50:11,082 INFO L600 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-15 23:50:11,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2779 states. [2019-11-15 23:50:11,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2779 to 2774. [2019-11-15 23:50:11,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2019-11-15 23:50:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 3761 transitions. [2019-11-15 23:50:11,165 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 3761 transitions. Word has length 99 [2019-11-15 23:50:11,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:11,166 INFO L462 AbstractCegarLoop]: Abstraction has 2774 states and 3761 transitions. [2019-11-15 23:50:11,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:50:11,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 3761 transitions. [2019-11-15 23:50:11,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-15 23:50:11,177 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:11,178 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 23:50:11,178 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:11,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:11,178 INFO L82 PathProgramCache]: Analyzing trace with hash 41144329, now seen corresponding path program 1 times [2019-11-15 23:50:11,179 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:11,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491145251] [2019-11-15 23:50:11,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:11,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:11,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:11,558 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-15 23:50:11,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491145251] [2019-11-15 23:50:11,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350597707] [2019-11-15 23:50:11,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:11,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:50:11,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:11,761 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-15 23:50:11,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:50:11,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-15 23:50:11,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517969434] [2019-11-15 23:50:11,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:50:11,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:11,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:50:11,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:11,764 INFO L87 Difference]: Start difference. First operand 2774 states and 3761 transitions. Second operand 3 states. [2019-11-15 23:50:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:13,990 INFO L93 Difference]: Finished difference Result 7940 states and 10821 transitions. [2019-11-15 23:50:13,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:50:13,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-11-15 23:50:13,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:14,024 INFO L225 Difference]: With dead ends: 7940 [2019-11-15 23:50:14,025 INFO L226 Difference]: Without dead ends: 5168 [2019-11-15 23:50:14,029 INFO L600 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-15 23:50:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2019-11-15 23:50:14,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 3073. [2019-11-15 23:50:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2019-11-15 23:50:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 4114 transitions. [2019-11-15 23:50:14,125 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 4114 transitions. Word has length 244 [2019-11-15 23:50:14,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:14,127 INFO L462 AbstractCegarLoop]: Abstraction has 3073 states and 4114 transitions. [2019-11-15 23:50:14,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:50:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 4114 transitions. [2019-11-15 23:50:14,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-11-15 23:50:14,133 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:14,133 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 23:50:14,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:14,346 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:14,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:14,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1594241081, now seen corresponding path program 1 times [2019-11-15 23:50:14,347 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:14,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683659723] [2019-11-15 23:50:14,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:14,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:14,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:14,990 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-15 23:50:14,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683659723] [2019-11-15 23:50:14,990 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:14,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:50:14,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110393153] [2019-11-15 23:50:14,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:50:14,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:14,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:50:14,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:50:14,993 INFO L87 Difference]: Start difference. First operand 3073 states and 4114 transitions. Second operand 5 states. [2019-11-15 23:50:19,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:19,595 INFO L93 Difference]: Finished difference Result 7342 states and 9540 transitions. [2019-11-15 23:50:19,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:50:19,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 312 [2019-11-15 23:50:19,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:19,622 INFO L225 Difference]: With dead ends: 7342 [2019-11-15 23:50:19,622 INFO L226 Difference]: Without dead ends: 4271 [2019-11-15 23:50:19,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:50:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2019-11-15 23:50:19,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 3971. [2019-11-15 23:50:19,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3971 states. [2019-11-15 23:50:19,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 5078 transitions. [2019-11-15 23:50:19,764 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 5078 transitions. Word has length 312 [2019-11-15 23:50:19,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:19,766 INFO L462 AbstractCegarLoop]: Abstraction has 3971 states and 5078 transitions. [2019-11-15 23:50:19,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:50:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 5078 transitions. [2019-11-15 23:50:19,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-11-15 23:50:19,776 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:19,776 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 23:50:19,777 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:19,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:19,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1017767819, now seen corresponding path program 1 times [2019-11-15 23:50:19,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:19,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581954065] [2019-11-15 23:50:19,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:19,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:19,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:20,133 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-15 23:50:20,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581954065] [2019-11-15 23:50:20,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:20,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:50:20,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932083021] [2019-11-15 23:50:20,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:50:20,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:20,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:50:20,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:20,136 INFO L87 Difference]: Start difference. First operand 3971 states and 5078 transitions. Second operand 4 states. [2019-11-15 23:50:24,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:24,055 INFO L93 Difference]: Finished difference Result 9739 states and 12737 transitions. [2019-11-15 23:50:24,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:50:24,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 386 [2019-11-15 23:50:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:24,085 INFO L225 Difference]: With dead ends: 9739 [2019-11-15 23:50:24,086 INFO L226 Difference]: Without dead ends: 5770 [2019-11-15 23:50:24,091 INFO L600 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-15 23:50:24,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2019-11-15 23:50:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5767. [2019-11-15 23:50:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5767 states. [2019-11-15 23:50:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 7242 transitions. [2019-11-15 23:50:24,210 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 7242 transitions. Word has length 386 [2019-11-15 23:50:24,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:24,211 INFO L462 AbstractCegarLoop]: Abstraction has 5767 states and 7242 transitions. [2019-11-15 23:50:24,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:50:24,211 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 7242 transitions. [2019-11-15 23:50:24,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-11-15 23:50:24,222 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:24,223 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 23:50:24,223 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:24,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:24,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1359235136, now seen corresponding path program 1 times [2019-11-15 23:50:24,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:24,224 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836962658] [2019-11-15 23:50:24,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:24,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:24,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:25,356 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-15 23:50:25,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836962658] [2019-11-15 23:50:25,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299862095] [2019-11-15 23:50:25,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:25,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:50:25,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:25,641 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-15 23:50:25,642 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:50:25,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-15 23:50:25,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582582381] [2019-11-15 23:50:25,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:50:25,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:25,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:50:25,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:50:25,645 INFO L87 Difference]: Start difference. First operand 5767 states and 7242 transitions. Second operand 3 states. [2019-11-15 23:50:27,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:27,158 INFO L93 Difference]: Finished difference Result 11532 states and 14482 transitions. [2019-11-15 23:50:27,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:50:27,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 461 [2019-11-15 23:50:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:27,195 INFO L225 Difference]: With dead ends: 11532 [2019-11-15 23:50:27,195 INFO L226 Difference]: Without dead ends: 5767 [2019-11-15 23:50:27,202 INFO L600 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-15 23:50:27,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2019-11-15 23:50:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5767. [2019-11-15 23:50:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5767 states. [2019-11-15 23:50:27,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 7110 transitions. [2019-11-15 23:50:27,328 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 7110 transitions. Word has length 461 [2019-11-15 23:50:27,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:27,330 INFO L462 AbstractCegarLoop]: Abstraction has 5767 states and 7110 transitions. [2019-11-15 23:50:27,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:50:27,330 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 7110 transitions. [2019-11-15 23:50:27,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-11-15 23:50:27,343 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:27,345 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 23:50:27,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:27,549 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:27,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:27,549 INFO L82 PathProgramCache]: Analyzing trace with hash 746660272, now seen corresponding path program 1 times [2019-11-15 23:50:27,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:27,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926100195] [2019-11-15 23:50:27,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:27,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:27,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:28,667 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-15 23:50:28,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926100195] [2019-11-15 23:50:28,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021696850] [2019-11-15 23:50:28,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:28,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:50:28,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:29,007 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-15 23:50:29,008 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:50:29,008 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-15 23:50:29,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948152027] [2019-11-15 23:50:29,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:50:29,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:29,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:50:29,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:50:29,010 INFO L87 Difference]: Start difference. First operand 5767 states and 7110 transitions. Second operand 3 states. [2019-11-15 23:50:32,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:32,802 INFO L93 Difference]: Finished difference Result 11531 states and 14218 transitions. [2019-11-15 23:50:32,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:50:32,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 537 [2019-11-15 23:50:32,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:32,829 INFO L225 Difference]: With dead ends: 11531 [2019-11-15 23:50:32,830 INFO L226 Difference]: Without dead ends: 5766 [2019-11-15 23:50:32,835 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 538 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:50:32,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2019-11-15 23:50:32,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 5764. [2019-11-15 23:50:32,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5764 states. [2019-11-15 23:50:32,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5764 states to 5764 states and 6589 transitions. [2019-11-15 23:50:32,933 INFO L78 Accepts]: Start accepts. Automaton has 5764 states and 6589 transitions. Word has length 537 [2019-11-15 23:50:32,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:32,934 INFO L462 AbstractCegarLoop]: Abstraction has 5764 states and 6589 transitions. [2019-11-15 23:50:32,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:50:32,934 INFO L276 IsEmpty]: Start isEmpty. Operand 5764 states and 6589 transitions. [2019-11-15 23:50:32,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2019-11-15 23:50:32,954 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:32,955 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-15 23:50:33,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:33,159 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:33,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:33,160 INFO L82 PathProgramCache]: Analyzing trace with hash -941780573, now seen corresponding path program 1 times [2019-11-15 23:50:33,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:33,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086271755] [2019-11-15 23:50:33,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:33,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:33,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:34,437 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-15 23:50:34,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086271755] [2019-11-15 23:50:34,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138161080] [2019-11-15 23:50:34,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/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-15 23:50:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:34,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:50:34,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:34,925 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-15 23:50:34,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:50:34,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-15 23:50:34,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48688018] [2019-11-15 23:50:34,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:50:34,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:34,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:50:34,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:50:34,929 INFO L87 Difference]: Start difference. First operand 5764 states and 6589 transitions. Second operand 3 states. [2019-11-15 23:50:38,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:38,163 INFO L93 Difference]: Finished difference Result 13020 states and 14983 transitions. [2019-11-15 23:50:38,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:50:38,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 562 [2019-11-15 23:50:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:38,186 INFO L225 Difference]: With dead ends: 13020 [2019-11-15 23:50:38,187 INFO L226 Difference]: Without dead ends: 7258 [2019-11-15 23:50:38,193 INFO L600 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-15 23:50:38,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7258 states. [2019-11-15 23:50:38,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7258 to 7258. [2019-11-15 23:50:38,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7258 states. [2019-11-15 23:50:38,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7258 states to 7258 states and 8190 transitions. [2019-11-15 23:50:38,296 INFO L78 Accepts]: Start accepts. Automaton has 7258 states and 8190 transitions. Word has length 562 [2019-11-15 23:50:38,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:38,297 INFO L462 AbstractCegarLoop]: Abstraction has 7258 states and 8190 transitions. [2019-11-15 23:50:38,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:50:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 7258 states and 8190 transitions. [2019-11-15 23:50:38,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2019-11-15 23:50:38,306 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:38,307 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 23:50:38,512 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:38,516 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:38,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:38,516 INFO L82 PathProgramCache]: Analyzing trace with hash -95465411, now seen corresponding path program 1 times [2019-11-15 23:50:38,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:38,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375892366] [2019-11-15 23:50:38,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:38,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:38,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:39,144 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-15 23:50:39,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375892366] [2019-11-15 23:50:39,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751132110] [2019-11-15 23:50:39,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/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-15 23:50:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:39,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:50:39,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:39,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:39,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:39,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:39,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:39,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:39,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:39,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:50:39,779 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 17 [2019-11-15 23:50:40,307 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-15 23:50:40,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:50:40,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-15 23:50:40,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559386091] [2019-11-15 23:50:40,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:50:40,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:40,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:50:40,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:50:40,310 INFO L87 Difference]: Start difference. First operand 7258 states and 8190 transitions. Second operand 3 states. [2019-11-15 23:51:20,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:20,061 INFO L93 Difference]: Finished difference Result 20211 states and 22785 transitions. [2019-11-15 23:51:20,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:51:20,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 596 [2019-11-15 23:51:20,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:20,102 INFO L225 Difference]: With dead ends: 20211 [2019-11-15 23:51:20,103 INFO L226 Difference]: Without dead ends: 12955 [2019-11-15 23:51:20,112 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 596 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:51:20,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12955 states. [2019-11-15 23:51:20,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12955 to 11746. [2019-11-15 23:51:20,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11746 states. [2019-11-15 23:51:20,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11746 states to 11746 states and 13247 transitions. [2019-11-15 23:51:20,295 INFO L78 Accepts]: Start accepts. Automaton has 11746 states and 13247 transitions. Word has length 596 [2019-11-15 23:51:20,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:20,297 INFO L462 AbstractCegarLoop]: Abstraction has 11746 states and 13247 transitions. [2019-11-15 23:51:20,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:51:20,297 INFO L276 IsEmpty]: Start isEmpty. Operand 11746 states and 13247 transitions. [2019-11-15 23:51:20,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-11-15 23:51:20,313 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:20,316 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-15 23:51:20,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:51:20,528 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:20,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:20,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1519482735, now seen corresponding path program 1 times [2019-11-15 23:51:20,528 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:20,529 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753189320] [2019-11-15 23:51:20,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:20,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:20,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:22,056 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-15 23:51:22,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753189320] [2019-11-15 23:51:22,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527910072] [2019-11-15 23:51:22,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/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-15 23:51:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:22,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:51:22,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:51:22,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-15 23:51:22,890 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-15 23:51:22,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:51:22,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2019-11-15 23:51:22,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885607087] [2019-11-15 23:51:22,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:51:22,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:22,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:51:22,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:51:22,893 INFO L87 Difference]: Start difference. First operand 11746 states and 13247 transitions. Second operand 5 states. [2019-11-15 23:51:28,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:28,455 INFO L93 Difference]: Finished difference Result 27832 states and 31337 transitions. [2019-11-15 23:51:28,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:51:28,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 675 [2019-11-15 23:51:28,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:28,492 INFO L225 Difference]: With dead ends: 27832 [2019-11-15 23:51:28,492 INFO L226 Difference]: Without dead ends: 16088 [2019-11-15 23:51:28,506 INFO L600 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-15 23:51:28,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16088 states. [2019-11-15 23:51:28,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16088 to 15636. [2019-11-15 23:51:28,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15636 states. [2019-11-15 23:51:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15636 states to 15636 states and 17354 transitions. [2019-11-15 23:51:28,779 INFO L78 Accepts]: Start accepts. Automaton has 15636 states and 17354 transitions. Word has length 675 [2019-11-15 23:51:28,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:28,781 INFO L462 AbstractCegarLoop]: Abstraction has 15636 states and 17354 transitions. [2019-11-15 23:51:28,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:51:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 15636 states and 17354 transitions. [2019-11-15 23:51:28,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2019-11-15 23:51:28,803 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:28,804 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-15 23:51:29,017 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:51:29,017 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:29,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:29,018 INFO L82 PathProgramCache]: Analyzing trace with hash 377870459, now seen corresponding path program 1 times [2019-11-15 23:51:29,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:29,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868477243] [2019-11-15 23:51:29,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:29,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:29,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:30,630 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 707 proven. 3 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 23:51:30,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868477243] [2019-11-15 23:51:30,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941641271] [2019-11-15 23:51:30,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/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-15 23:51:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:30,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:51:30,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:51:30,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:51:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 671 proven. 39 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 23:51:31,316 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:51:31,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-15 23:51:31,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129471859] [2019-11-15 23:51:31,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:51:31,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:31,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:51:31,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:51:31,319 INFO L87 Difference]: Start difference. First operand 15636 states and 17354 transitions. Second operand 9 states. [2019-11-15 23:51:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:51:40,247 INFO L93 Difference]: Finished difference Result 37404 states and 41218 transitions. [2019-11-15 23:51:40,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:51:40,248 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 700 [2019-11-15 23:51:40,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:51:40,274 INFO L225 Difference]: With dead ends: 37404 [2019-11-15 23:51:40,275 INFO L226 Difference]: Without dead ends: 16232 [2019-11-15 23:51:40,295 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 697 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:51:40,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16232 states. [2019-11-15 23:51:40,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16232 to 12943. [2019-11-15 23:51:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12943 states. [2019-11-15 23:51:40,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12943 states to 12943 states and 13556 transitions. [2019-11-15 23:51:40,763 INFO L78 Accepts]: Start accepts. Automaton has 12943 states and 13556 transitions. Word has length 700 [2019-11-15 23:51:40,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:51:40,764 INFO L462 AbstractCegarLoop]: Abstraction has 12943 states and 13556 transitions. [2019-11-15 23:51:40,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:51:40,764 INFO L276 IsEmpty]: Start isEmpty. Operand 12943 states and 13556 transitions. [2019-11-15 23:51:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2019-11-15 23:51:40,782 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:51:40,782 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 23:51:40,986 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:51:40,987 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:51:40,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:51:40,988 INFO L82 PathProgramCache]: Analyzing trace with hash -253950539, now seen corresponding path program 1 times [2019-11-15 23:51:40,988 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:51:40,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289842101] [2019-11-15 23:51:40,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:40,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:51:40,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:51:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:43,438 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-15 23:51:43,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289842101] [2019-11-15 23:51:43,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861027876] [2019-11-15 23:51:43,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/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-15 23:51:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:51:43,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 23:51:43,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:51:43,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:51:43,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:43,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:43,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:43,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:43,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:43,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:43,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:43,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:43,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:43,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:51:43,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-15 23:51:45,291 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-15 23:51:45,291 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:51:45,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 14 [2019-11-15 23:51:45,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492216877] [2019-11-15 23:51:45,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 23:51:45,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:51:45,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:51:45,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:51:45,294 INFO L87 Difference]: Start difference. First operand 12943 states and 13556 transitions. Second operand 14 states. [2019-11-15 23:52:04,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:04,353 INFO L93 Difference]: Finished difference Result 45463 states and 47594 transitions. [2019-11-15 23:52:04,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-11-15 23:52:04,354 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 703 [2019-11-15 23:52:04,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:04,389 INFO L225 Difference]: With dead ends: 45463 [2019-11-15 23:52:04,389 INFO L226 Difference]: Without dead ends: 32222 [2019-11-15 23:52:04,399 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 787 GetRequests, 733 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=619, Invalid=2351, Unknown=0, NotChecked=0, Total=2970 [2019-11-15 23:52:04,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32222 states. [2019-11-15 23:52:04,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32222 to 20347. [2019-11-15 23:52:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20347 states. [2019-11-15 23:52:04,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20347 states to 20347 states and 21109 transitions. [2019-11-15 23:52:04,737 INFO L78 Accepts]: Start accepts. Automaton has 20347 states and 21109 transitions. Word has length 703 [2019-11-15 23:52:04,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:04,738 INFO L462 AbstractCegarLoop]: Abstraction has 20347 states and 21109 transitions. [2019-11-15 23:52:04,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 23:52:04,738 INFO L276 IsEmpty]: Start isEmpty. Operand 20347 states and 21109 transitions. [2019-11-15 23:52:04,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2019-11-15 23:52:04,761 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:04,761 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-15 23:52:04,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:04,971 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:04,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:04,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1586778385, now seen corresponding path program 1 times [2019-11-15 23:52:04,971 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:04,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201086739] [2019-11-15 23:52:04,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:04,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:04,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:05,698 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-15 23:52:05,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201086739] [2019-11-15 23:52:05,698 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:05,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:05,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632078095] [2019-11-15 23:52:05,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:05,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:05,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:05,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:52:05,702 INFO L87 Difference]: Start difference. First operand 20347 states and 21109 transitions. Second operand 3 states. [2019-11-15 23:52:07,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:07,043 INFO L93 Difference]: Finished difference Result 41899 states and 43462 transitions. [2019-11-15 23:52:07,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:07,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 829 [2019-11-15 23:52:07,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:07,071 INFO L225 Difference]: With dead ends: 41899 [2019-11-15 23:52:07,072 INFO L226 Difference]: Without dead ends: 21255 [2019-11-15 23:52:07,084 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:52:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21255 states. [2019-11-15 23:52:07,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21255 to 19147. [2019-11-15 23:52:07,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19147 states. [2019-11-15 23:52:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19147 states to 19147 states and 19855 transitions. [2019-11-15 23:52:07,369 INFO L78 Accepts]: Start accepts. Automaton has 19147 states and 19855 transitions. Word has length 829 [2019-11-15 23:52:07,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:07,370 INFO L462 AbstractCegarLoop]: Abstraction has 19147 states and 19855 transitions. [2019-11-15 23:52:07,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:07,370 INFO L276 IsEmpty]: Start isEmpty. Operand 19147 states and 19855 transitions. [2019-11-15 23:52:07,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 877 [2019-11-15 23:52:07,398 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:07,399 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-15 23:52:07,400 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:07,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:07,401 INFO L82 PathProgramCache]: Analyzing trace with hash 508940287, now seen corresponding path program 1 times [2019-11-15 23:52:07,401 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:07,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092230714] [2019-11-15 23:52:07,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:07,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:07,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:10,752 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-15 23:52:10,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092230714] [2019-11-15 23:52:10,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036121418] [2019-11-15 23:52:10,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/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-15 23:52:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:10,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 1008 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:52:10,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:11,500 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-15 23:52:11,500 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:52:11,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-11-15 23:52:11,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255986496] [2019-11-15 23:52:11,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:11,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:11,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:11,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:52:11,502 INFO L87 Difference]: Start difference. First operand 19147 states and 19855 transitions. Second operand 3 states. [2019-11-15 23:52:12,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:12,622 INFO L93 Difference]: Finished difference Result 38292 states and 39708 transitions. [2019-11-15 23:52:12,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:12,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 876 [2019-11-15 23:52:12,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:12,645 INFO L225 Difference]: With dead ends: 38292 [2019-11-15 23:52:12,646 INFO L226 Difference]: Without dead ends: 19147 [2019-11-15 23:52:12,657 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 891 GetRequests, 876 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:52:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19147 states. [2019-11-15 23:52:12,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19147 to 17648. [2019-11-15 23:52:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17648 states. [2019-11-15 23:52:12,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17648 states to 17648 states and 18211 transitions. [2019-11-15 23:52:12,910 INFO L78 Accepts]: Start accepts. Automaton has 17648 states and 18211 transitions. Word has length 876 [2019-11-15 23:52:12,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:12,911 INFO L462 AbstractCegarLoop]: Abstraction has 17648 states and 18211 transitions. [2019-11-15 23:52:12,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:12,912 INFO L276 IsEmpty]: Start isEmpty. Operand 17648 states and 18211 transitions. [2019-11-15 23:52:12,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 882 [2019-11-15 23:52:12,940 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:12,941 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-15 23:52:13,145 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:13,145 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:13,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:13,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1348202738, now seen corresponding path program 1 times [2019-11-15 23:52:13,146 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:13,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392914066] [2019-11-15 23:52:13,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:13,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:13,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:14,687 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-15 23:52:14,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392914066] [2019-11-15 23:52:14,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713186774] [2019-11-15 23:52:14,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/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-15 23:52:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:14,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:52:14,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:15,378 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-15 23:52:15,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:52:15,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-15 23:52:15,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645169523] [2019-11-15 23:52:15,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:15,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:15,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:15,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:52:15,381 INFO L87 Difference]: Start difference. First operand 17648 states and 18211 transitions. Second operand 3 states. [2019-11-15 23:52:16,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:16,648 INFO L93 Difference]: Finished difference Result 35294 states and 36420 transitions. [2019-11-15 23:52:16,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:16,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 881 [2019-11-15 23:52:16,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:16,663 INFO L225 Difference]: With dead ends: 35294 [2019-11-15 23:52:16,663 INFO L226 Difference]: Without dead ends: 17648 [2019-11-15 23:52:16,673 INFO L600 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-15 23:52:16,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17648 states. [2019-11-15 23:52:16,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17648 to 17028. [2019-11-15 23:52:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17028 states. [2019-11-15 23:52:16,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17028 states to 17028 states and 17515 transitions. [2019-11-15 23:52:16,852 INFO L78 Accepts]: Start accepts. Automaton has 17028 states and 17515 transitions. Word has length 881 [2019-11-15 23:52:16,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:16,853 INFO L462 AbstractCegarLoop]: Abstraction has 17028 states and 17515 transitions. [2019-11-15 23:52:16,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:16,853 INFO L276 IsEmpty]: Start isEmpty. Operand 17028 states and 17515 transitions. [2019-11-15 23:52:16,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 896 [2019-11-15 23:52:16,865 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:16,866 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-15 23:52:17,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:17,067 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:17,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:17,067 INFO L82 PathProgramCache]: Analyzing trace with hash -926627041, now seen corresponding path program 1 times [2019-11-15 23:52:17,067 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:17,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504585022] [2019-11-15 23:52:17,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:17,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:17,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:18,293 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-15 23:52:18,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504585022] [2019-11-15 23:52:18,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:18,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:52:18,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467443471] [2019-11-15 23:52:18,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:52:18,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:18,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:52:18,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:18,296 INFO L87 Difference]: Start difference. First operand 17028 states and 17515 transitions. Second operand 4 states. [2019-11-15 23:52:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:20,024 INFO L93 Difference]: Finished difference Result 39427 states and 40609 transitions. [2019-11-15 23:52:20,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:52:20,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 895 [2019-11-15 23:52:20,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:20,050 INFO L225 Difference]: With dead ends: 39427 [2019-11-15 23:52:20,050 INFO L226 Difference]: Without dead ends: 22401 [2019-11-15 23:52:20,060 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:20,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22401 states. [2019-11-15 23:52:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22401 to 16190. [2019-11-15 23:52:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16190 states. [2019-11-15 23:52:20,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16190 states to 16190 states and 16605 transitions. [2019-11-15 23:52:20,271 INFO L78 Accepts]: Start accepts. Automaton has 16190 states and 16605 transitions. Word has length 895 [2019-11-15 23:52:20,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:20,271 INFO L462 AbstractCegarLoop]: Abstraction has 16190 states and 16605 transitions. [2019-11-15 23:52:20,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:52:20,272 INFO L276 IsEmpty]: Start isEmpty. Operand 16190 states and 16605 transitions. [2019-11-15 23:52:20,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 968 [2019-11-15 23:52:20,288 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:20,288 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-15 23:52:20,289 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:20,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:20,289 INFO L82 PathProgramCache]: Analyzing trace with hash 625408752, now seen corresponding path program 1 times [2019-11-15 23:52:20,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:20,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126635684] [2019-11-15 23:52:20,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:20,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:20,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:23,301 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-15 23:52:23,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126635684] [2019-11-15 23:52:23,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915501688] [2019-11-15 23:52:23,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/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-15 23:52:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:23,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:52:23,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:23,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:23,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:23,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:52:23,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:52:23,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:52:23,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:52:24,666 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-15 23:52:24,666 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:24,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-11-15 23:52:24,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046864895] [2019-11-15 23:52:24,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 23:52:24,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:24,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 23:52:24,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:52:24,670 INFO L87 Difference]: Start difference. First operand 16190 states and 16605 transitions. Second operand 17 states. [2019-11-15 23:52:34,412 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 38 [2019-11-15 23:52:48,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:48,714 INFO L93 Difference]: Finished difference Result 45562 states and 46697 transitions. [2019-11-15 23:52:48,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-11-15 23:52:48,715 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 967 [2019-11-15 23:52:48,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:48,741 INFO L225 Difference]: With dead ends: 45562 [2019-11-15 23:52:48,741 INFO L226 Difference]: Without dead ends: 29066 [2019-11-15 23:52:48,753 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1106 GetRequests, 1002 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4210 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2097, Invalid=9033, Unknown=0, NotChecked=0, Total=11130 [2019-11-15 23:52:48,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29066 states. [2019-11-15 23:52:48,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29066 to 20081. [2019-11-15 23:52:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20081 states. [2019-11-15 23:52:49,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20081 states to 20081 states and 20546 transitions. [2019-11-15 23:52:49,004 INFO L78 Accepts]: Start accepts. Automaton has 20081 states and 20546 transitions. Word has length 967 [2019-11-15 23:52:49,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:49,005 INFO L462 AbstractCegarLoop]: Abstraction has 20081 states and 20546 transitions. [2019-11-15 23:52:49,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 23:52:49,005 INFO L276 IsEmpty]: Start isEmpty. Operand 20081 states and 20546 transitions. [2019-11-15 23:52:49,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1073 [2019-11-15 23:52:49,029 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:49,030 INFO L380 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-15 23:52:49,234 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:49,234 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:49,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:49,235 INFO L82 PathProgramCache]: Analyzing trace with hash -19826569, now seen corresponding path program 1 times [2019-11-15 23:52:49,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:49,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142606500] [2019-11-15 23:52:49,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:49,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:49,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:50,393 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-15 23:52:50,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142606500] [2019-11-15 23:52:50,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:50,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:50,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170261144] [2019-11-15 23:52:50,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:50,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:50,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:50,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:52:50,395 INFO L87 Difference]: Start difference. First operand 20081 states and 20546 transitions. Second operand 3 states. [2019-11-15 23:52:51,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:51,503 INFO L93 Difference]: Finished difference Result 39859 states and 40787 transitions. [2019-11-15 23:52:51,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:51,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1072 [2019-11-15 23:52:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:51,519 INFO L225 Difference]: With dead ends: 39859 [2019-11-15 23:52:51,519 INFO L226 Difference]: Without dead ends: 19780 [2019-11-15 23:52:51,528 INFO L600 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-15 23:52:51,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19780 states. [2019-11-15 23:52:51,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19780 to 19780. [2019-11-15 23:52:51,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19780 states. [2019-11-15 23:52:51,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19780 states to 19780 states and 20241 transitions. [2019-11-15 23:52:51,731 INFO L78 Accepts]: Start accepts. Automaton has 19780 states and 20241 transitions. Word has length 1072 [2019-11-15 23:52:51,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:51,731 INFO L462 AbstractCegarLoop]: Abstraction has 19780 states and 20241 transitions. [2019-11-15 23:52:51,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:51,731 INFO L276 IsEmpty]: Start isEmpty. Operand 19780 states and 20241 transitions. [2019-11-15 23:52:51,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1094 [2019-11-15 23:52:51,756 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:51,757 INFO L380 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:51,758 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:51,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:51,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1177924935, now seen corresponding path program 1 times [2019-11-15 23:52:51,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:51,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899263798] [2019-11-15 23:52:51,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:51,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:51,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1739 backedges. 1373 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2019-11-15 23:52:52,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899263798] [2019-11-15 23:52:52,843 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:52,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:52:52,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874595054] [2019-11-15 23:52:52,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:52:52,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:52,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:52:52,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:52:52,846 INFO L87 Difference]: Start difference. First operand 19780 states and 20241 transitions. Second operand 5 states. [2019-11-15 23:52:54,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:54,921 INFO L93 Difference]: Finished difference Result 33535 states and 34245 transitions. [2019-11-15 23:52:54,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:52:54,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1093 [2019-11-15 23:52:54,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:54,932 INFO L225 Difference]: With dead ends: 33535 [2019-11-15 23:52:54,932 INFO L226 Difference]: Without dead ends: 13757 [2019-11-15 23:52:54,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:52:54,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13757 states. [2019-11-15 23:52:55,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13757 to 12297. [2019-11-15 23:52:55,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12297 states. [2019-11-15 23:52:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12297 states to 12297 states and 12491 transitions. [2019-11-15 23:52:55,072 INFO L78 Accepts]: Start accepts. Automaton has 12297 states and 12491 transitions. Word has length 1093 [2019-11-15 23:52:55,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:55,072 INFO L462 AbstractCegarLoop]: Abstraction has 12297 states and 12491 transitions. [2019-11-15 23:52:55,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:52:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 12297 states and 12491 transitions. [2019-11-15 23:52:55,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1136 [2019-11-15 23:52:55,085 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:55,086 INFO L380 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2019-11-15 23:52:55,086 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:55,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:55,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1285765188, now seen corresponding path program 1 times [2019-11-15 23:52:55,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:55,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762675782] [2019-11-15 23:52:55,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:55,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:55,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2110 backedges. 889 proven. 1103 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-15 23:53:00,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762675782] [2019-11-15 23:53:00,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523291272] [2019-11-15 23:53:00,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/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-15 23:53:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:00,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 1316 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:53:00,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:00,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:00,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:00,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:00,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:00,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:00,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:00,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:01,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 23:53:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2110 backedges. 1749 proven. 2 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2019-11-15 23:53:02,582 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:53:02,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 5] total 25 [2019-11-15 23:53:02,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908290747] [2019-11-15 23:53:02,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 23:53:02,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:02,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 23:53:02,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2019-11-15 23:53:02,585 INFO L87 Difference]: Start difference. First operand 12297 states and 12491 transitions. Second operand 25 states. [2019-11-15 23:53:15,067 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-11-15 23:53:26,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:26,993 INFO L93 Difference]: Finished difference Result 32328 states and 32832 transitions. [2019-11-15 23:53:26,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-11-15 23:53:26,993 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1135 [2019-11-15 23:53:26,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:27,008 INFO L225 Difference]: With dead ends: 32328 [2019-11-15 23:53:27,008 INFO L226 Difference]: Without dead ends: 20332 [2019-11-15 23:53:27,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1279 GetRequests, 1182 SyntacticMatches, 7 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2417 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1465, Invalid=6907, Unknown=0, NotChecked=0, Total=8372 [2019-11-15 23:53:27,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20332 states. [2019-11-15 23:53:27,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20332 to 13716. [2019-11-15 23:53:27,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13716 states. [2019-11-15 23:53:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13716 states to 13716 states and 13910 transitions. [2019-11-15 23:53:27,198 INFO L78 Accepts]: Start accepts. Automaton has 13716 states and 13910 transitions. Word has length 1135 [2019-11-15 23:53:27,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:27,199 INFO L462 AbstractCegarLoop]: Abstraction has 13716 states and 13910 transitions. [2019-11-15 23:53:27,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 23:53:27,199 INFO L276 IsEmpty]: Start isEmpty. Operand 13716 states and 13910 transitions. [2019-11-15 23:53:27,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1148 [2019-11-15 23:53:27,216 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:27,217 INFO L380 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, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 23:53:27,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:27,417 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:27,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:27,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1805484970, now seen corresponding path program 1 times [2019-11-15 23:53:27,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:27,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520038846] [2019-11-15 23:53:27,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:27,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:27,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2227 backedges. 1371 proven. 64 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2019-11-15 23:53:30,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520038846] [2019-11-15 23:53:30,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878266836] [2019-11-15 23:53:30,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:30,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 1334 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 23:53:30,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:31,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 23:53:31,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:31,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2227 backedges. 984 proven. 24 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2019-11-15 23:53:33,174 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:53:33,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2019-11-15 23:53:33,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079862783] [2019-11-15 23:53:33,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:53:33,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:33,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:53:33,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:53:33,177 INFO L87 Difference]: Start difference. First operand 13716 states and 13910 transitions. Second operand 16 states. [2019-11-15 23:53:34,545 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-11-15 23:53:50,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:50,048 INFO L93 Difference]: Finished difference Result 38567 states and 39109 transitions. [2019-11-15 23:53:50,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-11-15 23:53:50,049 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1147 [2019-11-15 23:53:50,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:50,072 INFO L225 Difference]: With dead ends: 38567 [2019-11-15 23:53:50,072 INFO L226 Difference]: Without dead ends: 25152 [2019-11-15 23:53:50,082 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1244 GetRequests, 1174 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1750 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=997, Invalid=3973, Unknown=0, NotChecked=0, Total=4970 [2019-11-15 23:53:50,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25152 states. [2019-11-15 23:53:50,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25152 to 11917. [2019-11-15 23:53:50,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11917 states. [2019-11-15 23:53:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11917 states to 11917 states and 12076 transitions. [2019-11-15 23:53:50,267 INFO L78 Accepts]: Start accepts. Automaton has 11917 states and 12076 transitions. Word has length 1147 [2019-11-15 23:53:50,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:50,268 INFO L462 AbstractCegarLoop]: Abstraction has 11917 states and 12076 transitions. [2019-11-15 23:53:50,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:53:50,268 INFO L276 IsEmpty]: Start isEmpty. Operand 11917 states and 12076 transitions. [2019-11-15 23:53:50,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1221 [2019-11-15 23:53:50,283 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:50,283 INFO L380 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-15 23:53:50,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:50,484 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:50,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:50,485 INFO L82 PathProgramCache]: Analyzing trace with hash -111973134, now seen corresponding path program 1 times [2019-11-15 23:53:50,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:50,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511807223] [2019-11-15 23:53:50,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:50,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:50,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:53,834 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-15 23:53:53,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511807223] [2019-11-15 23:53:53,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556395181] [2019-11-15 23:53:53,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:54,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 1376 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:53:54,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:54,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:54,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:54,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:54,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:54,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:54,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:54,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:54,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:53:57,802 WARN L191 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 60 DAG size of output: 25 [2019-11-15 23:53:57,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:54:00,284 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-15 23:54:00,285 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:54:00,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2019-11-15 23:54:00,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232686091] [2019-11-15 23:54:00,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 23:54:00,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:54:00,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 23:54:00,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:54:00,288 INFO L87 Difference]: Start difference. First operand 11917 states and 12076 transitions. Second operand 18 states. [2019-11-15 23:54:40,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:40,187 INFO L93 Difference]: Finished difference Result 39449 states and 39982 transitions. [2019-11-15 23:54:40,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-11-15 23:54:40,189 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1220 [2019-11-15 23:54:40,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:40,190 INFO L225 Difference]: With dead ends: 39449 [2019-11-15 23:54:40,190 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:54:40,202 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1368 GetRequests, 1281 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2691 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1226, Invalid=6606, Unknown=0, NotChecked=0, Total=7832 [2019-11-15 23:54:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:54:40,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:54:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:54:40,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:54:40,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1220 [2019-11-15 23:54:40,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:40,203 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:54:40,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 23:54:40,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:54:40,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:54:40,407 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:54:40,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:54:44,034 WARN L191 SmtUtils]: Spent 3.62 s on a formula simplification. DAG size of input: 1049 DAG size of output: 857 [2019-11-15 23:54:47,305 WARN L191 SmtUtils]: Spent 3.27 s on a formula simplification. DAG size of input: 1048 DAG size of output: 856 [2019-11-15 23:54:48,034 WARN L191 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 662 DAG size of output: 579 [2019-11-15 23:54:59,201 WARN L191 SmtUtils]: Spent 11.16 s on a formula simplification. DAG size of input: 788 DAG size of output: 183 [2019-11-15 23:55:11,483 WARN L191 SmtUtils]: Spent 12.28 s on a formula simplification. DAG size of input: 785 DAG size of output: 183 [2019-11-15 23:55:24,191 WARN L191 SmtUtils]: Spent 12.70 s on a formula simplification. DAG size of input: 538 DAG size of output: 180 [2019-11-15 23:55:24,193 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,193 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,193 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,193 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,193 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-15 23:55:24,193 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,194 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,194 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,194 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,194 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,194 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,194 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-15 23:55:24,194 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,194 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,194 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,194 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-15 23:55:24,194 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,194 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,194 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 23:55:24,194 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,194 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,194 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,194 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,195 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,195 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,195 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-15 23:55:24,195 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,195 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,195 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,195 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,195 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-15 23:55:24,195 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-15 23:55:24,195 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,195 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,195 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,195 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,195 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-15 23:55:24,195 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-15 23:55:24,195 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,196 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,196 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,196 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,196 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,196 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-15 23:55:24,196 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,196 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-15 23:55:24,196 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-15 23:55:24,196 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-15 23:55:24,196 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 23:55:24,196 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,196 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,196 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,197 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,197 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,197 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-15 23:55:24,197 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,197 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,197 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-15 23:55:24,197 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,197 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-15 23:55:24,197 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,197 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,197 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,197 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 23:55:24,198 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,198 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-15 23:55:24,198 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-15 23:55:24,198 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-15 23:55:24,198 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-15 23:55:24,198 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-15 23:55:24,198 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-15 23:55:24,198 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,198 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,198 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,198 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,198 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-15 23:55:24,199 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-15 23:55:24,199 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,199 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 23:55:24,199 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,199 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,199 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,199 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,199 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,199 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,199 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 23:55:24,199 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:55:24,199 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,200 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,200 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,200 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,200 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,200 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-15 23:55:24,200 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-15 23:55:24,200 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,200 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 23:55:24,200 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-15 23:55:24,200 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-15 23:55:24,200 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,200 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-15 23:55:24,200 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-15 23:55:24,201 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,201 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,201 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,201 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,201 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 23:55:24,201 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-15 23:55:24,201 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,201 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,201 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,201 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-15 23:55:24,201 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-15 23:55:24,201 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,201 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 23:55:24,202 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,203 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,204 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,204 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,204 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-15 23:55:24,204 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,204 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,204 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-15 23:55:24,204 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,204 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 23:55:24,204 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-15 23:55:24,204 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,204 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,204 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,204 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,204 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,204 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-15 23:55:24,206 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-15 23:55:24,206 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,206 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 23:55:24,206 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:55:24,206 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-15 23:55:24,206 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,206 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,206 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,206 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,207 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,207 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-15 23:55:24,207 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-15 23:55:24,207 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-15 23:55:24,207 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-15 23:55:24,207 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,207 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,207 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,207 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 23:55:24,207 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-15 23:55:24,207 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,207 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-15 23:55:24,207 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,207 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,207 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,207 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,207 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-15 23:55:24,208 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-15 23:55:24,208 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 23:55:24,208 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,208 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-15 23:55:24,208 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,208 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,208 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,208 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,208 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,208 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,208 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,208 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,208 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-15 23:55:24,208 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 23:55:24,209 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-15 23:55:24,209 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-15 23:55:24,209 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,209 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,209 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,209 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,210 INFO L439 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse35 (+ ~a0~0 98)) (.cse36 (+ ~a4~0 86)) (.cse3 (= 3 ~a2~0)) (.cse34 (+ ~a0~0 147))) (let ((.cse33 (+ ~a4~0 42)) (.cse30 (<= .cse34 0)) (.cse6 (not .cse3)) (.cse32 (+ ~a29~0 127)) (.cse31 (<= 0 (+ ~a0~0 44))) (.cse12 (= 1 ~a2~0)) (.cse28 (= 4 ~a2~0)) (.cse0 (<= .cse36 0)) (.cse4 (<= .cse35 0))) (let ((.cse11 (< 0 .cse36)) (.cse20 (<= (+ ~a0~0 104) 0)) (.cse2 (< 43 ~a29~0)) (.cse18 (<= (+ ~a0~0 148) 0)) (.cse15 (<= (+ ~a0~0 61) 0)) (.cse21 (< 0 (+ ~a29~0 16))) (.cse27 (<= ~a29~0 42)) (.cse17 (<= ~a2~0 4)) (.cse23 (<= ~a29~0 43)) (.cse19 (or .cse0 .cse4)) (.cse5 (not .cse28)) (.cse10 (<= 0 (+ ~a29~0 600000))) (.cse29 (or (and .cse12 .cse31) (and .cse0 .cse12))) (.cse16 (<= .cse32 0)) (.cse13 (or (and .cse31 .cse6) (and .cse0 .cse6))) (.cse7 (<= 3 ~a2~0)) (.cse24 (or .cse0 .cse30 (not (= 2 ULTIMATE.start_calculate_output_~input)))) (.cse8 (<= ~a29~0 41)) (.cse25 (or .cse0 .cse30 (not (= 2 ULTIMATE.start_calculate_output2_~input)) (< 0 .cse33) (< 0 .cse35))) (.cse1 (< 0 .cse34)) (.cse14 (= 2 ~a2~0)) (.cse9 (<= .cse33 0)) (.cse22 (<= 0 (+ ~a29~0 192415)))) (or (and (and (and .cse0 .cse1) .cse2) .cse3) (and (and (and .cse4 .cse5 .cse6 .cse7) .cse8 .cse9) .cse10) (and .cse9 .cse8 (and .cse11 .cse12 (< 0 (+ ~a29~0 144)))) (and .cse13 .cse14 .cse15) (and .cse0 .cse16 .cse10 .cse7 .cse17) (and .cse2 .cse9 .cse12 .cse18) (and .cse19 .cse14 .cse2 .cse9 (<= ~a29~0 599998)) (and (exists ((v_~a29~0_903 Int) (v_~a29~0_902 Int)) (and (< 43 v_~a29~0_903) (<= (+ ~a29~0 185997) (div v_~a29~0_903 5)) (< 43 v_~a29~0_902) (<= 0 v_~a29~0_902) (<= 0 v_~a29~0_903) (<= v_~a29~0_903 (+ (mod v_~a29~0_902 299978) 300021)))) (and .cse9 .cse20) .cse3) (and .cse9 (or (and .cse18 .cse16 .cse7) (and .cse18 (and .cse11 .cse5 .cse7))) .cse10) (and .cse0 .cse8 .cse21 .cse7) (and .cse9 .cse4 .cse5 .cse6 .cse7 .cse2) (and .cse0 (and .cse13 .cse2 .cse7)) (and .cse8 .cse1 .cse15 .cse9 .cse12 .cse22) (and .cse23 (and .cse10 (and .cse9 (and .cse12 .cse19 .cse1 .cse15)))) (and .cse20 .cse2 .cse9 (or .cse1 (not (= 1 ULTIMATE.start_calculate_output_~input))) .cse6 .cse7) (and .cse1 (and .cse24 .cse4 .cse9 .cse25 (<= 14659 ~a29~0) (and .cse5 .cse7))) (and .cse19 .cse13 .cse14 (exists ((v_prenex_1 Int)) (let ((.cse26 (div (* v_prenex_1 9) 10))) (and (<= 0 (* 9 v_prenex_1)) (<= 0 .cse26) (<= ~a29~0 (+ (mod .cse26 29) 14))))) .cse22) (and .cse9 .cse27 (and .cse18 .cse22) .cse28) (and (and .cse0 .cse15 .cse7) .cse23) (and .cse15 .cse29) (and .cse9 .cse21 (and .cse14 .cse30)) (and (and .cse9 .cse27 (and (and .cse13 .cse7) .cse17)) .cse10) (and .cse9 .cse30 .cse23 .cse3) (and .cse10 (and .cse19 .cse13 .cse14 .cse16)) (and .cse9 (and .cse30 .cse5 .cse6 .cse7) .cse10) (and (<= (+ ~a4~0 89) 0) .cse31 .cse29 (<= 0 .cse32) .cse16) (and .cse9 (and .cse8 (and .cse13 .cse22 .cse7))) (and .cse24 .cse4 .cse8 .cse25 .cse1 .cse14 .cse9 .cse22))))) [2019-11-15 23:55:24,210 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 23:55:24,210 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-15 23:55:24,211 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,211 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,211 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,211 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,211 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,211 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,211 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,212 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-15 23:55:24,212 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,212 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-15 23:55:24,212 INFO L446 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-15 23:55:24,212 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,212 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-15 23:55:24,212 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-15 23:55:24,213 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 23:55:24,213 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-15 23:55:24,213 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,213 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,213 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,213 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-11-15 23:55:24,213 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,214 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,214 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-15 23:55:24,214 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 23:55:24,214 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,214 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-15 23:55:24,214 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-15 23:55:24,214 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,215 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,215 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,215 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,215 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,215 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,216 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse26 (= 3 ~a2~0)) (.cse34 (+ ~a4~0 86)) (.cse35 (+ ~a0~0 98))) (let ((.cse31 (<= .cse35 0)) (.cse32 (+ ~a4~0 42)) (.cse18 (= 1 ~a2~0)) (.cse20 (<= 0 (+ ~a0~0 44))) (.cse0 (<= .cse34 0)) (.cse29 (not .cse26)) (.cse14 (= 4 ~a2~0)) (.cse22 (+ ~a29~0 127)) (.cse33 (+ ~a0~0 147))) (let ((.cse9 (<= .cse33 0)) (.cse19 (+ ~a29~0 144)) (.cse1 (<= .cse22 0)) (.cse13 (<= ~a29~0 42)) (.cse27 (<= (+ ~a0~0 148) 0)) (.cse8 (not .cse14)) (.cse4 (or (and .cse20 .cse29) (and .cse0 .cse29))) (.cse15 (<= (+ ~a0~0 61) 0)) (.cse21 (or (and .cse18 .cse20) (and .cse0 .cse18))) (.cse24 (<= 0 (+ ~a29~0 192415))) (.cse16 (<= ~a29~0 41)) (.cse12 (< 0 (+ ~a29~0 16))) (.cse11 (= 2 ~a2~0)) (.cse30 (or .cse0 (< 0 .cse32) (not (= 2 ULTIMATE.start_calculate_output_~input)) (< 0 .cse35))) (.cse17 (< 0 .cse34)) (.cse10 (or .cse0 .cse31)) (.cse2 (<= 0 (+ ~a29~0 600000))) (.cse25 (< 0 .cse33)) (.cse7 (<= ~a29~0 43)) (.cse28 (<= (+ ~a0~0 104) 0)) (.cse5 (< 43 ~a29~0)) (.cse6 (<= .cse32 0)) (.cse3 (<= 3 ~a2~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~a2~0 4)) (and .cse0 (and .cse4 .cse5 .cse3)) (and (and .cse6 .cse7 (and (and .cse8 .cse3) .cse9)) .cse2) (and (<= ~a29~0 599998) (and .cse6 .cse10) .cse11 .cse5) (and .cse12 (and .cse6 (and .cse9 .cse11))) (and (and .cse6 .cse13 .cse4 .cse14) .cse2) (and (and .cse0 .cse15 .cse3) .cse7) (and .cse6 (and .cse16 (and .cse17 .cse18 (< 0 .cse19)))) (and (<= (+ ~a4~0 89) 0) .cse20 .cse21 (<= 0 .cse22) .cse1) (and .cse4 .cse11 .cse15) (and .cse10 .cse4 .cse11 (exists ((v_prenex_1 Int)) (let ((.cse23 (div (* v_prenex_1 9) 10))) (and (<= 0 (* 9 v_prenex_1)) (<= 0 .cse23) (<= ~a29~0 (+ (mod .cse23 29) 14))))) .cse24) (and (and (and .cse0 .cse25) .cse5) .cse26) (and .cse0 (<= .cse19 0) .cse21) (and (and .cse10 .cse4 .cse11 .cse1) .cse2) (and .cse5 .cse6 .cse18 .cse27) (and (exists ((v_~a29~0_903 Int) (v_~a29~0_902 Int)) (and (< 43 v_~a29~0_903) (<= (+ ~a29~0 185997) (div v_~a29~0_903 5)) (< 43 v_~a29~0_902) (<= 0 v_~a29~0_902) (<= 0 v_~a29~0_903) (<= v_~a29~0_903 (+ (mod v_~a29~0_902 299978) 300021)))) (and .cse6 .cse28) .cse26) (and .cse0 .cse16 .cse12 .cse3) (and (and .cse6 (or (and .cse27 .cse1 .cse3) (and (and .cse17 .cse5 .cse3) .cse27))) .cse2) (and .cse6 .cse13 (and .cse27 .cse3 .cse24)) (and (and (and .cse10 .cse8 .cse29 .cse3) .cse6) .cse5) (and .cse16 .cse25 .cse15 .cse6 .cse18 .cse24) (and (and .cse16 .cse6 (and .cse10 .cse8 .cse15 .cse29 .cse3)) .cse2) (and .cse6 (and .cse16 (and .cse4 .cse3 .cse24))) (and .cse15 .cse21) (and .cse6 (or (and .cse30 .cse16 .cse10 .cse25 .cse11 .cse24) (and .cse16 .cse12 .cse10 .cse11))) (and (and .cse30 (<= 14659 ~a29~0) (and .cse31 .cse6) .cse26) .cse25) (and (and (and .cse6 (and .cse17 .cse18 .cse10)) .cse2) .cse25 .cse7) (and .cse28 .cse5 .cse6 .cse29 .cse3))))) [2019-11-15 23:55:24,216 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,216 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 23:55:24,216 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-15 23:55:24,216 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,217 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,217 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,217 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,217 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,217 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,217 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 23:55:24,217 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-15 23:55:24,218 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,218 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,218 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-15 23:55:24,218 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,218 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,218 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,218 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,218 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,219 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,219 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-15 23:55:24,219 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-15 23:55:24,219 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,219 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,219 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,219 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,220 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,220 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,220 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:55:24,220 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 23:55:24,220 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,220 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-15 23:55:24,220 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,220 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,221 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,221 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,221 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,221 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,221 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,221 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-15 23:55:24,221 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-15 23:55:24,222 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,222 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,222 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,222 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,222 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,222 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,222 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,222 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 23:55:24,223 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-15 23:55:24,223 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,223 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,223 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,223 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,223 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,223 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,223 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,224 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-15 23:55:24,224 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-15 23:55:24,224 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,224 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 23:55:24,224 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 23:55:24,224 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,224 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,224 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,225 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,225 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,225 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,226 INFO L439 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse23 (= 3 ~a2~0)) (.cse34 (+ ~a4~0 86)) (.cse35 (+ ~a0~0 98))) (let ((.cse29 (<= .cse35 0)) (.cse31 (+ ~a29~0 127)) (.cse18 (= 1 ~a2~0)) (.cse32 (+ ~a4~0 42)) (.cse30 (<= 0 (+ ~a0~0 44))) (.cse0 (<= .cse34 0)) (.cse27 (not .cse23)) (.cse14 (= 4 ~a2~0)) (.cse33 (+ ~a0~0 147))) (let ((.cse9 (<= .cse33 0)) (.cse19 (+ ~a29~0 144)) (.cse13 (<= ~a29~0 42)) (.cse25 (<= (+ ~a0~0 148) 0)) (.cse8 (not .cse14)) (.cse4 (or (and .cse30 .cse27) (and .cse0 .cse27))) (.cse15 (<= (+ ~a0~0 61) 0)) (.cse21 (<= 0 (+ ~a29~0 192415))) (.cse16 (<= ~a29~0 41)) (.cse12 (< 0 (+ ~a29~0 16))) (.cse11 (= 2 ~a2~0)) (.cse28 (or .cse0 (< 0 .cse32) (not (= 2 ULTIMATE.start_calculate_output_~input)) (< 0 .cse35))) (.cse24 (or (and .cse18 .cse30) (and .cse0 .cse18))) (.cse1 (<= .cse31 0)) (.cse17 (< 0 .cse34)) (.cse10 (or .cse0 .cse29)) (.cse2 (<= 0 (+ ~a29~0 600000))) (.cse22 (< 0 .cse33)) (.cse7 (<= ~a29~0 43)) (.cse26 (<= (+ ~a0~0 104) 0)) (.cse5 (< 43 ~a29~0)) (.cse6 (<= .cse32 0)) (.cse3 (<= 3 ~a2~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~a2~0 4)) (and .cse0 (and .cse4 .cse5 .cse3)) (and (and .cse6 .cse7 (and (and .cse8 .cse3) .cse9)) .cse2) (and (<= ~a29~0 599998) (and .cse6 .cse10) .cse11 .cse5) (and .cse12 (and .cse6 (and .cse9 .cse11))) (and (and .cse6 .cse13 .cse4 .cse14) .cse2) (and (and .cse0 .cse15 .cse3) .cse7) (and .cse6 (and .cse16 (and .cse17 .cse18 (< 0 .cse19)))) (and .cse4 .cse11 .cse15) (and .cse10 .cse4 .cse11 (exists ((v_prenex_1 Int)) (let ((.cse20 (div (* v_prenex_1 9) 10))) (and (<= 0 (* 9 v_prenex_1)) (<= 0 .cse20) (<= ~a29~0 (+ (mod .cse20 29) 14))))) .cse21) (and (and (and .cse0 .cse22) .cse5) .cse23) (and .cse0 (<= .cse19 0) .cse24) (and (and .cse10 .cse4 .cse11 .cse1) .cse2) (and .cse5 .cse6 .cse18 .cse25) (and (exists ((v_~a29~0_903 Int) (v_~a29~0_902 Int)) (and (< 43 v_~a29~0_903) (<= (+ ~a29~0 185997) (div v_~a29~0_903 5)) (< 43 v_~a29~0_902) (<= 0 v_~a29~0_902) (<= 0 v_~a29~0_903) (<= v_~a29~0_903 (+ (mod v_~a29~0_902 299978) 300021)))) (and .cse6 .cse26) .cse23) (and .cse0 .cse16 .cse12 .cse3) (and (and .cse6 (or (and .cse25 .cse1 .cse3) (and (and .cse17 .cse5 .cse3) .cse25))) .cse2) (and .cse6 .cse13 (and .cse25 .cse3 .cse21)) (and (and (and .cse10 .cse8 .cse27 .cse3) .cse6) .cse5) (and .cse16 .cse22 .cse15 .cse6 .cse18 .cse21) (and (and .cse16 .cse6 (and .cse10 .cse8 .cse15 .cse27 .cse3)) .cse2) (and .cse6 (and .cse16 (and .cse4 .cse3 .cse21))) (and .cse15 .cse24) (and .cse6 (or (and .cse28 .cse16 .cse10 .cse22 .cse11 .cse21) (and .cse16 .cse12 .cse10 .cse11))) (and (and .cse28 (<= 14659 ~a29~0) (and .cse29 .cse6) .cse23) .cse22) (and (<= (+ ~a4~0 89) 0) .cse30 .cse24 (<= 0 .cse31) .cse1) (and (and (and .cse6 (and .cse17 .cse18 .cse10)) .cse2) .cse22 .cse7) (and .cse26 .cse5 .cse6 .cse27 .cse3))))) [2019-11-15 23:55:24,226 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-15 23:55:24,226 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-15 23:55:24,226 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,226 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,226 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,227 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,227 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,227 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,227 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,227 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,227 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-15 23:55:24,227 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 23:55:24,227 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,228 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-15 23:55:24,228 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-15 23:55:24,228 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,228 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,228 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,228 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,228 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,228 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-15 23:55:24,229 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-15 23:55:24,229 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,229 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,229 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,229 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,229 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-15 23:55:24,229 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-15 23:55:24,229 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-15 23:55:24,230 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,230 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-15 23:55:24,230 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 23:55:24,230 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,230 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,230 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,230 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,230 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,231 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,231 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,231 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-15 23:55:24,231 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-15 23:55:24,231 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,231 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,231 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,232 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-15 23:55:24,232 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,232 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:55:24,232 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,232 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-15 23:55:24,232 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,232 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,232 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,233 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,233 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,233 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,233 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,233 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-15 23:55:24,233 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-15 23:55:24,233 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,233 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-15 23:55:24,234 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,234 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,234 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,234 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-15 23:55:24,234 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,234 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,234 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,235 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,235 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-15 23:55:24,235 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,235 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,235 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-15 23:55:24,235 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-15 23:55:24,235 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,235 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,236 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,236 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-15 23:55:24,236 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,236 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,236 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,236 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,236 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,236 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 23:55:24,237 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,237 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,237 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-15 23:55:24,237 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-15 23:55:24,237 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,237 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 23:55:24,237 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-15 23:55:24,238 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,238 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 23:55:24,238 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,238 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-15 23:55:24,238 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-15 23:55:24,238 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,238 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,238 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-15 23:55:24,239 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-15 23:55:24,239 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-15 23:55:24,250 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,251 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,252 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,253 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,253 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,253 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,254 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,254 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,254 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,255 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,273 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,275 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,275 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,275 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,281 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,281 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,296 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,296 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,296 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,297 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,297 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,297 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:55:24 BoogieIcfgContainer [2019-11-15 23:55:24,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:55:24,309 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:55:24,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:55:24,310 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:55:24,310 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:49:58" (3/4) ... [2019-11-15 23:55:24,313 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:55:24,349 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-15 23:55:24,353 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:55:24,385 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((a4 + 86 <= 0 && a29 + 127 <= 0) && 0 <= a29 + 600000) && 3 <= a2) && a2 <= 4) || (a4 + 86 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 43 < a29) && 3 <= a2)) || (((a4 + 42 <= 0 && a29 <= 43) && (!(4 == a2) && 3 <= a2) && a0 + 147 <= 0) && 0 <= a29 + 600000)) || (((a29 <= 599998 && a4 + 42 <= 0 && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 2 == a2) && 43 < a29)) || (0 < a29 + 16 && a4 + 42 <= 0 && a0 + 147 <= 0 && 2 == a2)) || ((((a4 + 42 <= 0 && a29 <= 42) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 4 == a2) && 0 <= a29 + 600000)) || (((a4 + 86 <= 0 && a0 + 61 <= 0) && 3 <= a2) && a29 <= 43)) || (a4 + 42 <= 0 && a29 <= 41 && (0 < a4 + 86 && 1 == a2) && 0 < a29 + 144)) || ((((a4 + 89 <= 0 && 0 <= a0 + 44) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a29 + 127) && a29 + 127 <= 0)) || ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 2 == a2) && a0 + 61 <= 0)) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 0 <= a29 + 192415)) || (((a4 + 86 <= 0 && 0 < a0 + 147) && 43 < a29) && 3 == a2)) || ((a4 + 86 <= 0 && a29 + 144 <= 0) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)))) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && a29 + 127 <= 0) && 0 <= a29 + 600000)) || (((43 < a29 && a4 + 42 <= 0) && 1 == a2) && a0 + 148 <= 0)) || (((\exists v_~a29~0_903 : int, v_~a29~0_902 : int :: ((((43 < v_~a29~0_903 && a29 + 185997 <= v_~a29~0_903 / 5) && 43 < v_~a29~0_902) && 0 <= v_~a29~0_902) && 0 <= v_~a29~0_903) && v_~a29~0_903 <= v_~a29~0_902 % 299978 + 300021) && a4 + 42 <= 0 && a0 + 104 <= 0) && 3 == a2)) || (((a4 + 86 <= 0 && a29 <= 41) && 0 < a29 + 16) && 3 <= a2)) || ((a4 + 42 <= 0 && (((a0 + 148 <= 0 && a29 + 127 <= 0) && 3 <= a2) || (((0 < a4 + 86 && 43 < a29) && 3 <= a2) && a0 + 148 <= 0))) && 0 <= a29 + 600000)) || ((a4 + 42 <= 0 && a29 <= 42) && (a0 + 148 <= 0 && 3 <= a2) && 0 <= a29 + 192415)) || ((((((a4 + 86 <= 0 || a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && a4 + 42 <= 0) && 43 < a29)) || (((((a29 <= 41 && 0 < a0 + 147) && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 192415)) || (((a29 <= 41 && a4 + 42 <= 0) && ((((a4 + 86 <= 0 || a0 + 98 <= 0) && !(4 == a2)) && a0 + 61 <= 0) && !(3 == a2)) && 3 <= a2) && 0 <= a29 + 600000)) || (a4 + 42 <= 0 && a29 <= 41 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 3 <= a2) && 0 <= a29 + 192415)) || (a0 + 61 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)))) || (a4 + 42 <= 0 && (((((((((a4 + 86 <= 0 || 0 < a4 + 42) || !(2 == input)) || 0 < a0 + 98) && a29 <= 41) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 < a0 + 147) && 2 == a2) && 0 <= a29 + 192415) || (((a29 <= 41 && 0 < a29 + 16) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 2 == a2)))) || (((((((a4 + 86 <= 0 || 0 < a4 + 42) || !(2 == input)) || 0 < a0 + 98) && 14659 <= a29) && a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2) && 0 < a0 + 147)) || ((((a4 + 42 <= 0 && (0 < a4 + 86 && 1 == a2) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 <= a29 + 600000) && 0 < a0 + 147) && a29 <= 43)) || ((((a0 + 104 <= 0 && 43 < a29) && a4 + 42 <= 0) && !(3 == a2)) && 3 <= a2) [2019-11-15 23:55:24,389 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((a4 + 86 <= 0 && a29 + 127 <= 0) && 0 <= a29 + 600000) && 3 <= a2) && a2 <= 4) || (a4 + 86 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 43 < a29) && 3 <= a2)) || (((a4 + 42 <= 0 && a29 <= 43) && (!(4 == a2) && 3 <= a2) && a0 + 147 <= 0) && 0 <= a29 + 600000)) || (((a29 <= 599998 && a4 + 42 <= 0 && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 2 == a2) && 43 < a29)) || (0 < a29 + 16 && a4 + 42 <= 0 && a0 + 147 <= 0 && 2 == a2)) || ((((a4 + 42 <= 0 && a29 <= 42) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 4 == a2) && 0 <= a29 + 600000)) || (((a4 + 86 <= 0 && a0 + 61 <= 0) && 3 <= a2) && a29 <= 43)) || (a4 + 42 <= 0 && a29 <= 41 && (0 < a4 + 86 && 1 == a2) && 0 < a29 + 144)) || ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 2 == a2) && a0 + 61 <= 0)) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 0 <= a29 + 192415)) || (((a4 + 86 <= 0 && 0 < a0 + 147) && 43 < a29) && 3 == a2)) || ((a4 + 86 <= 0 && a29 + 144 <= 0) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)))) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && a29 + 127 <= 0) && 0 <= a29 + 600000)) || (((43 < a29 && a4 + 42 <= 0) && 1 == a2) && a0 + 148 <= 0)) || (((\exists v_~a29~0_903 : int, v_~a29~0_902 : int :: ((((43 < v_~a29~0_903 && a29 + 185997 <= v_~a29~0_903 / 5) && 43 < v_~a29~0_902) && 0 <= v_~a29~0_902) && 0 <= v_~a29~0_903) && v_~a29~0_903 <= v_~a29~0_902 % 299978 + 300021) && a4 + 42 <= 0 && a0 + 104 <= 0) && 3 == a2)) || (((a4 + 86 <= 0 && a29 <= 41) && 0 < a29 + 16) && 3 <= a2)) || ((a4 + 42 <= 0 && (((a0 + 148 <= 0 && a29 + 127 <= 0) && 3 <= a2) || (((0 < a4 + 86 && 43 < a29) && 3 <= a2) && a0 + 148 <= 0))) && 0 <= a29 + 600000)) || ((a4 + 42 <= 0 && a29 <= 42) && (a0 + 148 <= 0 && 3 <= a2) && 0 <= a29 + 192415)) || ((((((a4 + 86 <= 0 || a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && a4 + 42 <= 0) && 43 < a29)) || (((((a29 <= 41 && 0 < a0 + 147) && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 192415)) || (((a29 <= 41 && a4 + 42 <= 0) && ((((a4 + 86 <= 0 || a0 + 98 <= 0) && !(4 == a2)) && a0 + 61 <= 0) && !(3 == a2)) && 3 <= a2) && 0 <= a29 + 600000)) || (a4 + 42 <= 0 && a29 <= 41 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 3 <= a2) && 0 <= a29 + 192415)) || (a0 + 61 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)))) || (a4 + 42 <= 0 && (((((((((a4 + 86 <= 0 || 0 < a4 + 42) || !(2 == input)) || 0 < a0 + 98) && a29 <= 41) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 < a0 + 147) && 2 == a2) && 0 <= a29 + 192415) || (((a29 <= 41 && 0 < a29 + 16) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 2 == a2)))) || (((((((a4 + 86 <= 0 || 0 < a4 + 42) || !(2 == input)) || 0 < a0 + 98) && 14659 <= a29) && a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2) && 0 < a0 + 147)) || ((((a4 + 89 <= 0 && 0 <= a0 + 44) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a29 + 127) && a29 + 127 <= 0)) || ((((a4 + 42 <= 0 && (0 < a4 + 86 && 1 == a2) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 <= a29 + 600000) && 0 < a0 + 147) && a29 <= 43)) || ((((a0 + 104 <= 0 && 43 < a29) && a4 + 42 <= 0) && !(3 == a2)) && 3 <= a2) [2019-11-15 23:55:24,400 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((a4 + 86 <= 0 && 0 < a0 + 147) && 43 < a29) && 3 == a2) || ((((((a0 + 98 <= 0 && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && a29 <= 41) && a4 + 42 <= 0) && 0 <= a29 + 600000)) || ((a4 + 42 <= 0 && a29 <= 41) && (0 < a4 + 86 && 1 == a2) && 0 < a29 + 144)) || ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 2 == a2) && a0 + 61 <= 0)) || ((((a4 + 86 <= 0 && a29 + 127 <= 0) && 0 <= a29 + 600000) && 3 <= a2) && a2 <= 4)) || (((43 < a29 && a4 + 42 <= 0) && 1 == a2) && a0 + 148 <= 0)) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && 2 == a2) && 43 < a29) && a4 + 42 <= 0) && a29 <= 599998)) || (((\exists v_~a29~0_903 : int, v_~a29~0_902 : int :: ((((43 < v_~a29~0_903 && a29 + 185997 <= v_~a29~0_903 / 5) && 43 < v_~a29~0_902) && 0 <= v_~a29~0_902) && 0 <= v_~a29~0_903) && v_~a29~0_903 <= v_~a29~0_902 % 299978 + 300021) && a4 + 42 <= 0 && a0 + 104 <= 0) && 3 == a2)) || ((a4 + 42 <= 0 && (((a0 + 148 <= 0 && a29 + 127 <= 0) && 3 <= a2) || (a0 + 148 <= 0 && (0 < a4 + 86 && !(4 == a2)) && 3 <= a2))) && 0 <= a29 + 600000)) || (((a4 + 86 <= 0 && a29 <= 41) && 0 < a29 + 16) && 3 <= a2)) || (((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 43 < a29)) || (a4 + 86 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 43 < a29) && 3 <= a2)) || (((((a29 <= 41 && 0 < a0 + 147) && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 192415)) || (a29 <= 43 && 0 <= a29 + 600000 && a4 + 42 <= 0 && ((1 == a2 && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 < a0 + 147) && a0 + 61 <= 0)) || (((((a0 + 104 <= 0 && 43 < a29) && a4 + 42 <= 0) && (0 < a0 + 147 || !(1 == input))) && !(3 == a2)) && 3 <= a2)) || (0 < a0 + 147 && ((((((a4 + 86 <= 0 || a0 + 147 <= 0) || !(2 == input)) && a0 + 98 <= 0) && a4 + 42 <= 0) && ((((a4 + 86 <= 0 || a0 + 147 <= 0) || !(2 == input)) || 0 < a4 + 42) || 0 < a0 + 98)) && 14659 <= a29) && !(4 == a2) && 3 <= a2)) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 0 <= a29 + 192415)) || (((a4 + 42 <= 0 && a29 <= 42) && a0 + 148 <= 0 && 0 <= a29 + 192415) && 4 == a2)) || (((a4 + 86 <= 0 && a0 + 61 <= 0) && 3 <= a2) && a29 <= 43)) || (a0 + 61 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)))) || ((a4 + 42 <= 0 && 0 < a29 + 16) && 2 == a2 && a0 + 147 <= 0)) || (((a4 + 42 <= 0 && a29 <= 42) && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 3 <= a2) && a2 <= 4) && 0 <= a29 + 600000)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 <= 43) && 3 == a2)) || (0 <= a29 + 600000 && (((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && a29 + 127 <= 0)) || ((a4 + 42 <= 0 && ((a0 + 147 <= 0 && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 0 <= a29 + 600000)) || ((((a4 + 89 <= 0 && 0 <= a0 + 44) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a29 + 127) && a29 + 127 <= 0)) || (a4 + 42 <= 0 && a29 <= 41 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 0 <= a29 + 192415) && 3 <= a2)) || (((((((((a4 + 86 <= 0 || a0 + 147 <= 0) || !(2 == input)) && a0 + 98 <= 0) && a29 <= 41) && ((((a4 + 86 <= 0 || a0 + 147 <= 0) || !(2 == input)) || 0 < a4 + 42) || 0 < a0 + 98)) && 0 < a0 + 147) && 2 == a2) && a4 + 42 <= 0) && 0 <= a29 + 192415) [2019-11-15 23:55:24,567 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3c050eba-1f79-48a1-a15e-51a0a0aa5bce/bin/uautomizer/witness.graphml [2019-11-15 23:55:24,568 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:55:24,569 INFO L168 Benchmark]: Toolchain (without parser) took 331044.73 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 939.4 MB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 217.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:24,569 INFO L168 Benchmark]: CDTParser took 0.32 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-15 23:55:24,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1426.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -120.5 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:24,570 INFO L168 Benchmark]: Boogie Procedure Inliner took 225.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:24,571 INFO L168 Benchmark]: Boogie Preprocessor took 216.38 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: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:24,571 INFO L168 Benchmark]: RCFGBuilder took 3469.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -150.7 MB). Peak memory consumption was 237.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:24,571 INFO L168 Benchmark]: TraceAbstraction took 325441.92 ms. Allocated memory was 1.3 GB in the beginning and 4.6 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: -3.2 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-11-15 23:55:24,572 INFO L168 Benchmark]: Witness Printer took 258.65 ms. Allocated memory is still 4.6 GB. Free memory was 4.4 GB in the beginning and 4.3 GB in the end (delta: 98.3 MB). Peak memory consumption was 98.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:24,574 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.32 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 1426.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -120.5 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 225.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 216.38 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: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3469.88 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -150.7 MB). Peak memory consumption was 237.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 325441.92 ms. Allocated memory was 1.3 GB in the beginning and 4.6 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: -3.2 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 258.65 ms. Allocated memory is still 4.6 GB. Free memory was 4.4 GB in the beginning and 4.3 GB in the end (delta: 98.3 MB). Peak memory consumption was 98.3 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_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,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-15 23:55:24,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,592 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,592 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,593 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,593 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,593 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,594 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,594 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,594 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((a4 + 86 <= 0 && a29 + 127 <= 0) && 0 <= a29 + 600000) && 3 <= a2) && a2 <= 4) || (a4 + 86 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 43 < a29) && 3 <= a2)) || (((a4 + 42 <= 0 && a29 <= 43) && (!(4 == a2) && 3 <= a2) && a0 + 147 <= 0) && 0 <= a29 + 600000)) || (((a29 <= 599998 && a4 + 42 <= 0 && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 2 == a2) && 43 < a29)) || (0 < a29 + 16 && a4 + 42 <= 0 && a0 + 147 <= 0 && 2 == a2)) || ((((a4 + 42 <= 0 && a29 <= 42) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 4 == a2) && 0 <= a29 + 600000)) || (((a4 + 86 <= 0 && a0 + 61 <= 0) && 3 <= a2) && a29 <= 43)) || (a4 + 42 <= 0 && a29 <= 41 && (0 < a4 + 86 && 1 == a2) && 0 < a29 + 144)) || ((((a4 + 89 <= 0 && 0 <= a0 + 44) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a29 + 127) && a29 + 127 <= 0)) || ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 2 == a2) && a0 + 61 <= 0)) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 0 <= a29 + 192415)) || (((a4 + 86 <= 0 && 0 < a0 + 147) && 43 < a29) && 3 == a2)) || ((a4 + 86 <= 0 && a29 + 144 <= 0) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)))) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && a29 + 127 <= 0) && 0 <= a29 + 600000)) || (((43 < a29 && a4 + 42 <= 0) && 1 == a2) && a0 + 148 <= 0)) || (((\exists v_~a29~0_903 : int, v_~a29~0_902 : int :: ((((43 < v_~a29~0_903 && a29 + 185997 <= v_~a29~0_903 / 5) && 43 < v_~a29~0_902) && 0 <= v_~a29~0_902) && 0 <= v_~a29~0_903) && v_~a29~0_903 <= v_~a29~0_902 % 299978 + 300021) && a4 + 42 <= 0 && a0 + 104 <= 0) && 3 == a2)) || (((a4 + 86 <= 0 && a29 <= 41) && 0 < a29 + 16) && 3 <= a2)) || ((a4 + 42 <= 0 && (((a0 + 148 <= 0 && a29 + 127 <= 0) && 3 <= a2) || (((0 < a4 + 86 && 43 < a29) && 3 <= a2) && a0 + 148 <= 0))) && 0 <= a29 + 600000)) || ((a4 + 42 <= 0 && a29 <= 42) && (a0 + 148 <= 0 && 3 <= a2) && 0 <= a29 + 192415)) || ((((((a4 + 86 <= 0 || a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && a4 + 42 <= 0) && 43 < a29)) || (((((a29 <= 41 && 0 < a0 + 147) && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 192415)) || (((a29 <= 41 && a4 + 42 <= 0) && ((((a4 + 86 <= 0 || a0 + 98 <= 0) && !(4 == a2)) && a0 + 61 <= 0) && !(3 == a2)) && 3 <= a2) && 0 <= a29 + 600000)) || (a4 + 42 <= 0 && a29 <= 41 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 3 <= a2) && 0 <= a29 + 192415)) || (a0 + 61 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)))) || (a4 + 42 <= 0 && (((((((((a4 + 86 <= 0 || 0 < a4 + 42) || !(2 == input)) || 0 < a0 + 98) && a29 <= 41) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 < a0 + 147) && 2 == a2) && 0 <= a29 + 192415) || (((a29 <= 41 && 0 < a29 + 16) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 2 == a2)))) || (((((((a4 + 86 <= 0 || 0 < a4 + 42) || !(2 == input)) || 0 < a0 + 98) && 14659 <= a29) && a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2) && 0 < a0 + 147)) || ((((a4 + 42 <= 0 && (0 < a4 + 86 && 1 == a2) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 <= a29 + 600000) && 0 < a0 + 147) && a29 <= 43)) || ((((a0 + 104 <= 0 && 43 < a29) && a4 + 42 <= 0) && !(3 == a2)) && 3 <= a2) - InvariantResult [Line: 23]: Loop Invariant [2019-11-15 23:55:24,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,603 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,603 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,604 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,604 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,604 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,604 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((a4 + 86 <= 0 && a29 + 127 <= 0) && 0 <= a29 + 600000) && 3 <= a2) && a2 <= 4) || (a4 + 86 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 43 < a29) && 3 <= a2)) || (((a4 + 42 <= 0 && a29 <= 43) && (!(4 == a2) && 3 <= a2) && a0 + 147 <= 0) && 0 <= a29 + 600000)) || (((a29 <= 599998 && a4 + 42 <= 0 && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 2 == a2) && 43 < a29)) || (0 < a29 + 16 && a4 + 42 <= 0 && a0 + 147 <= 0 && 2 == a2)) || ((((a4 + 42 <= 0 && a29 <= 42) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 4 == a2) && 0 <= a29 + 600000)) || (((a4 + 86 <= 0 && a0 + 61 <= 0) && 3 <= a2) && a29 <= 43)) || (a4 + 42 <= 0 && a29 <= 41 && (0 < a4 + 86 && 1 == a2) && 0 < a29 + 144)) || ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 2 == a2) && a0 + 61 <= 0)) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 0 <= a29 + 192415)) || (((a4 + 86 <= 0 && 0 < a0 + 147) && 43 < a29) && 3 == a2)) || ((a4 + 86 <= 0 && a29 + 144 <= 0) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)))) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && a29 + 127 <= 0) && 0 <= a29 + 600000)) || (((43 < a29 && a4 + 42 <= 0) && 1 == a2) && a0 + 148 <= 0)) || (((\exists v_~a29~0_903 : int, v_~a29~0_902 : int :: ((((43 < v_~a29~0_903 && a29 + 185997 <= v_~a29~0_903 / 5) && 43 < v_~a29~0_902) && 0 <= v_~a29~0_902) && 0 <= v_~a29~0_903) && v_~a29~0_903 <= v_~a29~0_902 % 299978 + 300021) && a4 + 42 <= 0 && a0 + 104 <= 0) && 3 == a2)) || (((a4 + 86 <= 0 && a29 <= 41) && 0 < a29 + 16) && 3 <= a2)) || ((a4 + 42 <= 0 && (((a0 + 148 <= 0 && a29 + 127 <= 0) && 3 <= a2) || (((0 < a4 + 86 && 43 < a29) && 3 <= a2) && a0 + 148 <= 0))) && 0 <= a29 + 600000)) || ((a4 + 42 <= 0 && a29 <= 42) && (a0 + 148 <= 0 && 3 <= a2) && 0 <= a29 + 192415)) || ((((((a4 + 86 <= 0 || a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && a4 + 42 <= 0) && 43 < a29)) || (((((a29 <= 41 && 0 < a0 + 147) && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 192415)) || (((a29 <= 41 && a4 + 42 <= 0) && ((((a4 + 86 <= 0 || a0 + 98 <= 0) && !(4 == a2)) && a0 + 61 <= 0) && !(3 == a2)) && 3 <= a2) && 0 <= a29 + 600000)) || (a4 + 42 <= 0 && a29 <= 41 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 3 <= a2) && 0 <= a29 + 192415)) || (a0 + 61 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)))) || (a4 + 42 <= 0 && (((((((((a4 + 86 <= 0 || 0 < a4 + 42) || !(2 == input)) || 0 < a0 + 98) && a29 <= 41) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 < a0 + 147) && 2 == a2) && 0 <= a29 + 192415) || (((a29 <= 41 && 0 < a29 + 16) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 2 == a2)))) || (((((((a4 + 86 <= 0 || 0 < a4 + 42) || !(2 == input)) || 0 < a0 + 98) && 14659 <= a29) && a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2) && 0 < a0 + 147)) || ((((a4 + 89 <= 0 && 0 <= a0 + 44) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a29 + 127) && a29 + 127 <= 0)) || ((((a4 + 42 <= 0 && (0 < a4 + 86 && 1 == a2) && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 <= a29 + 600000) && 0 < a0 + 147) && a29 <= 43)) || ((((a0 + 104 <= 0 && 43 < a29) && a4 + 42 <= 0) && !(3 == a2)) && 3 <= a2) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-15 23:55:24,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,611 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-15 23:55:24,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_902,QUANTIFIED] [2019-11-15 23:55:24,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 23:55:24,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a4 + 86 <= 0 && 0 < a0 + 147) && 43 < a29) && 3 == a2) || ((((((a0 + 98 <= 0 && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && a29 <= 41) && a4 + 42 <= 0) && 0 <= a29 + 600000)) || ((a4 + 42 <= 0 && a29 <= 41) && (0 < a4 + 86 && 1 == a2) && 0 < a29 + 144)) || ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 2 == a2) && a0 + 61 <= 0)) || ((((a4 + 86 <= 0 && a29 + 127 <= 0) && 0 <= a29 + 600000) && 3 <= a2) && a2 <= 4)) || (((43 < a29 && a4 + 42 <= 0) && 1 == a2) && a0 + 148 <= 0)) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && 2 == a2) && 43 < a29) && a4 + 42 <= 0) && a29 <= 599998)) || (((\exists v_~a29~0_903 : int, v_~a29~0_902 : int :: ((((43 < v_~a29~0_903 && a29 + 185997 <= v_~a29~0_903 / 5) && 43 < v_~a29~0_902) && 0 <= v_~a29~0_902) && 0 <= v_~a29~0_903) && v_~a29~0_903 <= v_~a29~0_902 % 299978 + 300021) && a4 + 42 <= 0 && a0 + 104 <= 0) && 3 == a2)) || ((a4 + 42 <= 0 && (((a0 + 148 <= 0 && a29 + 127 <= 0) && 3 <= a2) || (a0 + 148 <= 0 && (0 < a4 + 86 && !(4 == a2)) && 3 <= a2))) && 0 <= a29 + 600000)) || (((a4 + 86 <= 0 && a29 <= 41) && 0 < a29 + 16) && 3 <= a2)) || (((((a4 + 42 <= 0 && a0 + 98 <= 0) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 43 < a29)) || (a4 + 86 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 43 < a29) && 3 <= a2)) || (((((a29 <= 41 && 0 < a0 + 147) && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 192415)) || (a29 <= 43 && 0 <= a29 + 600000 && a4 + 42 <= 0 && ((1 == a2 && (a4 + 86 <= 0 || a0 + 98 <= 0)) && 0 < a0 + 147) && a0 + 61 <= 0)) || (((((a0 + 104 <= 0 && 43 < a29) && a4 + 42 <= 0) && (0 < a0 + 147 || !(1 == input))) && !(3 == a2)) && 3 <= a2)) || (0 < a0 + 147 && ((((((a4 + 86 <= 0 || a0 + 147 <= 0) || !(2 == input)) && a0 + 98 <= 0) && a4 + 42 <= 0) && ((((a4 + 86 <= 0 || a0 + 147 <= 0) || !(2 == input)) || 0 < a4 + 42) || 0 < a0 + 98)) && 14659 <= a29) && !(4 == a2) && 3 <= a2)) || (((((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14)) && 0 <= a29 + 192415)) || (((a4 + 42 <= 0 && a29 <= 42) && a0 + 148 <= 0 && 0 <= a29 + 192415) && 4 == a2)) || (((a4 + 86 <= 0 && a0 + 61 <= 0) && 3 <= a2) && a29 <= 43)) || (a0 + 61 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2)))) || ((a4 + 42 <= 0 && 0 < a29 + 16) && 2 == a2 && a0 + 147 <= 0)) || (((a4 + 42 <= 0 && a29 <= 42) && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 3 <= a2) && a2 <= 4) && 0 <= a29 + 600000)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 <= 43) && 3 == a2)) || (0 <= a29 + 600000 && (((a4 + 86 <= 0 || a0 + 98 <= 0) && ((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2)))) && 2 == a2) && a29 + 127 <= 0)) || ((a4 + 42 <= 0 && ((a0 + 147 <= 0 && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && 0 <= a29 + 600000)) || ((((a4 + 89 <= 0 && 0 <= a0 + 44) && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a29 + 127) && a29 + 127 <= 0)) || (a4 + 42 <= 0 && a29 <= 41 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 86 <= 0 && !(3 == a2))) && 0 <= a29 + 192415) && 3 <= a2)) || (((((((((a4 + 86 <= 0 || a0 + 147 <= 0) || !(2 == input)) && a0 + 98 <= 0) && a29 <= 41) && ((((a4 + 86 <= 0 || a0 + 147 <= 0) || !(2 == input)) || 0 < a4 + 42) || 0 < a0 + 98)) && 0 < a0 + 147) && 2 == a2) && a4 + 42 <= 0) && 0 <= a29 + 192415) - 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: 325.2s, OverallIterations: 22, TraceHistogramMax: 7, AutomataDifference: 218.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 43.7s, HoareTripleCheckerStatistics: 5059 SDtfs, 68329 SDslu, 3169 SDs, 0 SdLazy, 139997 SolverSat, 10244 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 172.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11437 GetRequests, 10914 SyntacticMatches, 40 SemanticMatches, 483 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12084 ImplicationChecksByTransitivity, 25.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20347occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 59966 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 371 NumberOfFragments, 2825 HoareAnnotationTreeSize, 4 FomulaSimplifications, 8986823 FormulaSimplificationTreeSizeReduction, 7.6s HoareSimplificationTime, 4 FomulaSimplificationsInter, 3149998 FormulaSimplificationTreeSizeReductionInter, 36.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 26.8s InterpolantComputationTime, 26128 NumberOfCodeBlocks, 26128 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 26092 ConstructedInterpolants, 648 QuantifiedInterpolants, 133339274 SizeOfPredicates, 35 NumberOfNonLiveVariables, 12500 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 36 InterpolantComputations, 16 PerfectInterpolantSequences, 31369/34588 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...