./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label26.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label26.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/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 470b628433c20f1f4cfd605e13f92536d937b372 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:18:42,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:18:42,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:18:42,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:18:42,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:18:42,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:18:42,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:18:42,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:18:43,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:18:43,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:18:43,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:18:43,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:18:43,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:18:43,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:18:43,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:18:43,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:18:43,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:18:43,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:18:43,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:18:43,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:18:43,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:18:43,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:18:43,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:18:43,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:18:43,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:18:43,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:18:43,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:18:43,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:18:43,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:18:43,016 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:18:43,016 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:18:43,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:18:43,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:18:43,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:18:43,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:18:43,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:18:43,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:18:43,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:18:43,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:18:43,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:18:43,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:18:43,020 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:18:43,029 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:18:43,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:18:43,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:18:43,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:18:43,030 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:18:43,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:18:43,030 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:18:43,030 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:18:43,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:18:43,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:18:43,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:18:43,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:18:43,031 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:18:43,031 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:18:43,031 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:18:43,031 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:18:43,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:18:43,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:18:43,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:18:43,032 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:18:43,032 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:18:43,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:18:43,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:18:43,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:18:43,032 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:18:43,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:18:43,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:18:43,033 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:18:43,033 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:18:43,033 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_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/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 -> 470b628433c20f1f4cfd605e13f92536d937b372 [2019-12-07 17:18:43,136 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:18:43,146 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:18:43,149 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:18:43,150 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:18:43,151 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:18:43,151 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label26.c [2019-12-07 17:18:43,196 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/bin/uautomizer/data/258cde42e/3cc5a89a83d341aba75340c9d652b27c/FLAG297ce6910 [2019-12-07 17:18:43,714 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:18:43,715 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/sv-benchmarks/c/eca-rers2012/Problem15_label26.c [2019-12-07 17:18:43,727 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/bin/uautomizer/data/258cde42e/3cc5a89a83d341aba75340c9d652b27c/FLAG297ce6910 [2019-12-07 17:18:43,977 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/bin/uautomizer/data/258cde42e/3cc5a89a83d341aba75340c9d652b27c [2019-12-07 17:18:43,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:18:43,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:18:43,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:18:43,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:18:43,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:18:43,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:18:43" (1/1) ... [2019-12-07 17:18:44,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@106f2ea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:18:43, skipping insertion in model container [2019-12-07 17:18:44,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:18:43" (1/1) ... [2019-12-07 17:18:44,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:18:44,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:18:44,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:18:44,481 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:18:44,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:18:44,676 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:18:44,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:18:44 WrapperNode [2019-12-07 17:18:44,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:18:44,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:18:44,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:18:44,677 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:18:44,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:18:44" (1/1) ... [2019-12-07 17:18:44,706 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:18:44" (1/1) ... [2019-12-07 17:18:44,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:18:44,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:18:44,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:18:44,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:18:44,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:18:44" (1/1) ... [2019-12-07 17:18:44,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:18:44" (1/1) ... [2019-12-07 17:18:44,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:18:44" (1/1) ... [2019-12-07 17:18:44,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:18:44" (1/1) ... [2019-12-07 17:18:44,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:18:44" (1/1) ... [2019-12-07 17:18:44,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:18:44" (1/1) ... [2019-12-07 17:18:44,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:18:44" (1/1) ... [2019-12-07 17:18:44,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:18:44,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:18:44,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:18:44,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:18:44,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:18:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/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-12-07 17:18:44,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:18:44,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:18:46,612 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:18:46,613 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 17:18:46,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:18:46 BoogieIcfgContainer [2019-12-07 17:18:46,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:18:46,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:18:46,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:18:46,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:18:46,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:18:43" (1/3) ... [2019-12-07 17:18:46,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d4e12e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:18:46, skipping insertion in model container [2019-12-07 17:18:46,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:18:44" (2/3) ... [2019-12-07 17:18:46,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d4e12e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:18:46, skipping insertion in model container [2019-12-07 17:18:46,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:18:46" (3/3) ... [2019-12-07 17:18:46,618 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label26.c [2019-12-07 17:18:46,624 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:18:46,629 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:18:46,636 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:18:46,656 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:18:46,656 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:18:46,656 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:18:46,656 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:18:46,656 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:18:46,656 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:18:46,656 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:18:46,656 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:18:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-12-07 17:18:46,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:18:46,678 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:46,678 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:18:46,678 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:46,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:46,682 INFO L82 PathProgramCache]: Analyzing trace with hash -92557335, now seen corresponding path program 1 times [2019-12-07 17:18:46,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:46,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201233516] [2019-12-07 17:18:46,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:46,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:18:46,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201233516] [2019-12-07 17:18:46,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:46,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:18:46,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492024177] [2019-12-07 17:18:46,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:18:46,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:46,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:18:46,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:18:46,890 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-12-07 17:18:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:49,851 INFO L93 Difference]: Finished difference Result 1466 states and 2715 transitions. [2019-12-07 17:18:49,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:18:49,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-07 17:18:49,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:49,870 INFO L225 Difference]: With dead ends: 1466 [2019-12-07 17:18:49,870 INFO L226 Difference]: Without dead ends: 974 [2019-12-07 17:18:49,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:18:49,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-12-07 17:18:49,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 972. [2019-12-07 17:18:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-12-07 17:18:49,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1407 transitions. [2019-12-07 17:18:49,933 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1407 transitions. Word has length 53 [2019-12-07 17:18:49,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:49,934 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 1407 transitions. [2019-12-07 17:18:49,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:18:49,934 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1407 transitions. [2019-12-07 17:18:49,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 17:18:49,938 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:49,938 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 17:18:49,938 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:49,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:49,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1371805199, now seen corresponding path program 1 times [2019-12-07 17:18:49,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:49,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742063519] [2019-12-07 17:18:49,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:50,049 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:18:50,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742063519] [2019-12-07 17:18:50,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:50,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:18:50,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702669667] [2019-12-07 17:18:50,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:18:50,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:50,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:18:50,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:18:50,052 INFO L87 Difference]: Start difference. First operand 972 states and 1407 transitions. Second operand 4 states. [2019-12-07 17:18:52,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:52,888 INFO L93 Difference]: Finished difference Result 3751 states and 5444 transitions. [2019-12-07 17:18:52,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:18:52,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-12-07 17:18:52,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:52,903 INFO L225 Difference]: With dead ends: 3751 [2019-12-07 17:18:52,903 INFO L226 Difference]: Without dead ends: 2781 [2019-12-07 17:18:52,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:18:52,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2019-12-07 17:18:52,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2477. [2019-12-07 17:18:52,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2477 states. [2019-12-07 17:18:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3302 transitions. [2019-12-07 17:18:52,954 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3302 transitions. Word has length 118 [2019-12-07 17:18:52,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:52,955 INFO L462 AbstractCegarLoop]: Abstraction has 2477 states and 3302 transitions. [2019-12-07 17:18:52,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:18:52,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3302 transitions. [2019-12-07 17:18:52,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-12-07 17:18:52,962 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:52,963 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:18:52,963 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:52,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:52,963 INFO L82 PathProgramCache]: Analyzing trace with hash 687400732, now seen corresponding path program 1 times [2019-12-07 17:18:52,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:52,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763423158] [2019-12-07 17:18:52,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:53,175 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 101 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-12-07 17:18:53,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763423158] [2019-12-07 17:18:53,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105611928] [2019-12-07 17:18:53,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/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-12-07 17:18:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:53,248 INFO L264 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:18:53,256 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:18:53,331 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:18:53,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:18:53,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-12-07 17:18:53,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250424872] [2019-12-07 17:18:53,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:18:53,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:53,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:18:53,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:18:53,333 INFO L87 Difference]: Start difference. First operand 2477 states and 3302 transitions. Second operand 3 states. [2019-12-07 17:18:54,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:54,646 INFO L93 Difference]: Finished difference Result 7345 states and 9794 transitions. [2019-12-07 17:18:54,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:18:54,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-12-07 17:18:54,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:54,664 INFO L225 Difference]: With dead ends: 7345 [2019-12-07 17:18:54,664 INFO L226 Difference]: Without dead ends: 4870 [2019-12-07 17:18:54,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 263 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-12-07 17:18:54,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2019-12-07 17:18:54,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 2775. [2019-12-07 17:18:54,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2775 states. [2019-12-07 17:18:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 3654 transitions. [2019-12-07 17:18:54,715 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 3654 transitions. Word has length 263 [2019-12-07 17:18:54,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:54,716 INFO L462 AbstractCegarLoop]: Abstraction has 2775 states and 3654 transitions. [2019-12-07 17:18:54,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:18:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3654 transitions. [2019-12-07 17:18:54,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-12-07 17:18:54,719 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:54,720 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:18:54,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:18:54,921 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:54,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:54,921 INFO L82 PathProgramCache]: Analyzing trace with hash -628651217, now seen corresponding path program 1 times [2019-12-07 17:18:54,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:54,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092822538] [2019-12-07 17:18:54,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-12-07 17:18:55,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092822538] [2019-12-07 17:18:55,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:55,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:18:55,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791452414] [2019-12-07 17:18:55,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:18:55,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:55,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:18:55,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:18:55,303 INFO L87 Difference]: Start difference. First operand 2775 states and 3654 transitions. Second operand 5 states. [2019-12-07 17:18:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:58,327 INFO L93 Difference]: Finished difference Result 6746 states and 8608 transitions. [2019-12-07 17:18:58,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:18:58,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 330 [2019-12-07 17:18:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:58,341 INFO L225 Difference]: With dead ends: 6746 [2019-12-07 17:18:58,341 INFO L226 Difference]: Without dead ends: 3973 [2019-12-07 17:18:58,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:18:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2019-12-07 17:18:58,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 3673. [2019-12-07 17:18:58,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3673 states. [2019-12-07 17:18:58,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 4606 transitions. [2019-12-07 17:18:58,403 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 4606 transitions. Word has length 330 [2019-12-07 17:18:58,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:58,404 INFO L462 AbstractCegarLoop]: Abstraction has 3673 states and 4606 transitions. [2019-12-07 17:18:58,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:18:58,404 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 4606 transitions. [2019-12-07 17:18:58,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-12-07 17:18:58,409 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:58,409 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:18:58,409 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:58,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:58,410 INFO L82 PathProgramCache]: Analyzing trace with hash 424213697, now seen corresponding path program 1 times [2019-12-07 17:18:58,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:58,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887148750] [2019-12-07 17:18:58,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 111 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:18:59,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887148750] [2019-12-07 17:18:59,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472175880] [2019-12-07 17:18:59,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/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-12-07 17:18:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:59,105 INFO L264 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:18:59,111 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:18:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:18:59,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:18:59,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-12-07 17:18:59,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708937478] [2019-12-07 17:18:59,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:18:59,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:59,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:18:59,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:18:59,212 INFO L87 Difference]: Start difference. First operand 3673 states and 4606 transitions. Second operand 3 states. [2019-12-07 17:19:00,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:19:00,976 INFO L93 Difference]: Finished difference Result 7344 states and 9242 transitions. [2019-12-07 17:19:00,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:19:00,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 404 [2019-12-07 17:19:00,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:19:00,987 INFO L225 Difference]: With dead ends: 7344 [2019-12-07 17:19:00,988 INFO L226 Difference]: Without dead ends: 3673 [2019-12-07 17:19:00,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 404 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:19:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3673 states. [2019-12-07 17:19:01,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3673 to 3671. [2019-12-07 17:19:01,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3671 states. [2019-12-07 17:19:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 4356 transitions. [2019-12-07 17:19:01,026 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 4356 transitions. Word has length 404 [2019-12-07 17:19:01,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:19:01,026 INFO L462 AbstractCegarLoop]: Abstraction has 3671 states and 4356 transitions. [2019-12-07 17:19:01,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:19:01,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 4356 transitions. [2019-12-07 17:19:01,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-12-07 17:19:01,029 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:19:01,029 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 17:19:01,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:19:01,230 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:19:01,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:19:01,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1079722266, now seen corresponding path program 1 times [2019-12-07 17:19:01,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:19:01,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922975698] [2019-12-07 17:19:01,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:19:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-12-07 17:19:01,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922975698] [2019-12-07 17:19:01,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:19:01,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:19:01,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6153148] [2019-12-07 17:19:01,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:19:01,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:19:01,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:19:01,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:19:01,432 INFO L87 Difference]: Start difference. First operand 3671 states and 4356 transitions. Second operand 4 states. [2019-12-07 17:19:03,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:19:03,651 INFO L93 Difference]: Finished difference Result 9137 states and 11217 transitions. [2019-12-07 17:19:03,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:19:03,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 421 [2019-12-07 17:19:03,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:19:03,668 INFO L225 Difference]: With dead ends: 9137 [2019-12-07 17:19:03,669 INFO L226 Difference]: Without dead ends: 5468 [2019-12-07 17:19:03,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:19:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5468 states. [2019-12-07 17:19:03,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5468 to 5467. [2019-12-07 17:19:03,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5467 states. [2019-12-07 17:19:03,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5467 states to 5467 states and 6522 transitions. [2019-12-07 17:19:03,734 INFO L78 Accepts]: Start accepts. Automaton has 5467 states and 6522 transitions. Word has length 421 [2019-12-07 17:19:03,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:19:03,734 INFO L462 AbstractCegarLoop]: Abstraction has 5467 states and 6522 transitions. [2019-12-07 17:19:03,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:19:03,734 INFO L276 IsEmpty]: Start isEmpty. Operand 5467 states and 6522 transitions. [2019-12-07 17:19:03,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-12-07 17:19:03,764 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:19:03,765 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 17:19:03,765 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:19:03,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:19:03,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1964586309, now seen corresponding path program 1 times [2019-12-07 17:19:03,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:19:03,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666881818] [2019-12-07 17:19:03,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:19:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-12-07 17:19:04,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666881818] [2019-12-07 17:19:04,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:19:04,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:19:04,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345534317] [2019-12-07 17:19:04,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:19:04,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:19:04,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:19:04,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:19:04,003 INFO L87 Difference]: Start difference. First operand 5467 states and 6522 transitions. Second operand 3 states. [2019-12-07 17:19:05,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:19:05,831 INFO L93 Difference]: Finished difference Result 12725 states and 15454 transitions. [2019-12-07 17:19:05,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:19:05,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 517 [2019-12-07 17:19:05,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:19:05,858 INFO L225 Difference]: With dead ends: 12725 [2019-12-07 17:19:05,858 INFO L226 Difference]: Without dead ends: 7260 [2019-12-07 17:19:05,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:19:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7260 states. [2019-12-07 17:19:05,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7260 to 7260. [2019-12-07 17:19:05,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7260 states. [2019-12-07 17:19:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7260 states to 7260 states and 8644 transitions. [2019-12-07 17:19:05,928 INFO L78 Accepts]: Start accepts. Automaton has 7260 states and 8644 transitions. Word has length 517 [2019-12-07 17:19:05,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:19:05,928 INFO L462 AbstractCegarLoop]: Abstraction has 7260 states and 8644 transitions. [2019-12-07 17:19:05,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:19:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 7260 states and 8644 transitions. [2019-12-07 17:19:05,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2019-12-07 17:19:05,934 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:19:05,934 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:19:05,934 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:19:05,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:19:05,935 INFO L82 PathProgramCache]: Analyzing trace with hash 667607770, now seen corresponding path program 1 times [2019-12-07 17:19:05,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:19:05,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011052580] [2019-12-07 17:19:05,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:19:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:06,859 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 634 proven. 3 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-12-07 17:19:06,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011052580] [2019-12-07 17:19:06,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591915492] [2019-12-07 17:19:06,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/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-12-07 17:19:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:06,986 INFO L264 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:19:06,993 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:19:07,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:19:07,443 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 598 proven. 39 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-12-07 17:19:07,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:19:07,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-12-07 17:19:07,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204511520] [2019-12-07 17:19:07,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:19:07,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:19:07,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:19:07,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:19:07,445 INFO L87 Difference]: Start difference. First operand 7260 states and 8644 transitions. Second operand 9 states. [2019-12-07 17:19:13,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:19:13,609 INFO L93 Difference]: Finished difference Result 19457 states and 22803 transitions. [2019-12-07 17:19:13,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:19:13,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 608 [2019-12-07 17:19:13,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:19:13,620 INFO L225 Difference]: With dead ends: 19457 [2019-12-07 17:19:13,620 INFO L226 Difference]: Without dead ends: 9053 [2019-12-07 17:19:13,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 606 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:19:13,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9053 states. [2019-12-07 17:19:13,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9053 to 6660. [2019-12-07 17:19:13,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-12-07 17:19:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 7156 transitions. [2019-12-07 17:19:13,687 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 7156 transitions. Word has length 608 [2019-12-07 17:19:13,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:19:13,688 INFO L462 AbstractCegarLoop]: Abstraction has 6660 states and 7156 transitions. [2019-12-07 17:19:13,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:19:13,688 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 7156 transitions. [2019-12-07 17:19:13,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2019-12-07 17:19:13,692 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:19:13,693 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:19:13,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:19:13,894 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:19:13,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:19:13,895 INFO L82 PathProgramCache]: Analyzing trace with hash -450281948, now seen corresponding path program 1 times [2019-12-07 17:19:13,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:19:13,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479955873] [2019-12-07 17:19:13,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:19:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:14,197 INFO L134 CoverageAnalysis]: Checked inductivity of 824 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-12-07 17:19:14,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479955873] [2019-12-07 17:19:14,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:19:14,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:19:14,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468210396] [2019-12-07 17:19:14,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:19:14,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:19:14,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:19:14,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:19:14,199 INFO L87 Difference]: Start difference. First operand 6660 states and 7156 transitions. Second operand 3 states. [2019-12-07 17:19:15,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:19:15,072 INFO L93 Difference]: Finished difference Result 13316 states and 14308 transitions. [2019-12-07 17:19:15,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:19:15,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 650 [2019-12-07 17:19:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:19:15,079 INFO L225 Difference]: With dead ends: 13316 [2019-12-07 17:19:15,079 INFO L226 Difference]: Without dead ends: 6658 [2019-12-07 17:19:15,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:19:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6658 states. [2019-12-07 17:19:15,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6658 to 6658. [2019-12-07 17:19:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6658 states. [2019-12-07 17:19:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6658 states to 6658 states and 7152 transitions. [2019-12-07 17:19:15,132 INFO L78 Accepts]: Start accepts. Automaton has 6658 states and 7152 transitions. Word has length 650 [2019-12-07 17:19:15,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:19:15,133 INFO L462 AbstractCegarLoop]: Abstraction has 6658 states and 7152 transitions. [2019-12-07 17:19:15,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:19:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 6658 states and 7152 transitions. [2019-12-07 17:19:15,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2019-12-07 17:19:15,139 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:19:15,140 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:19:15,140 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:19:15,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:19:15,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1610580137, now seen corresponding path program 1 times [2019-12-07 17:19:15,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:19:15,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662078310] [2019-12-07 17:19:15,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:19:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:15,859 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 473 proven. 201 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-12-07 17:19:15,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662078310] [2019-12-07 17:19:15,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576428712] [2019-12-07 17:19:15,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/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-12-07 17:19:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:15,983 INFO L264 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:19:15,988 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:19:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-12-07 17:19:16,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:19:16,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-12-07 17:19:16,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211321632] [2019-12-07 17:19:16,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:19:16,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:19:16,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:19:16,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:19:16,237 INFO L87 Difference]: Start difference. First operand 6658 states and 7152 transitions. Second operand 3 states. [2019-12-07 17:19:17,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:19:17,053 INFO L93 Difference]: Finished difference Result 13315 states and 14304 transitions. [2019-12-07 17:19:17,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:19:17,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 663 [2019-12-07 17:19:17,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:19:17,060 INFO L225 Difference]: With dead ends: 13315 [2019-12-07 17:19:17,061 INFO L226 Difference]: Without dead ends: 6659 [2019-12-07 17:19:17,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 664 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:19:17,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6659 states. [2019-12-07 17:19:17,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6659 to 6656. [2019-12-07 17:19:17,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6656 states. [2019-12-07 17:19:17,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6656 states to 6656 states and 7064 transitions. [2019-12-07 17:19:17,115 INFO L78 Accepts]: Start accepts. Automaton has 6656 states and 7064 transitions. Word has length 663 [2019-12-07 17:19:17,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:19:17,116 INFO L462 AbstractCegarLoop]: Abstraction has 6656 states and 7064 transitions. [2019-12-07 17:19:17,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:19:17,116 INFO L276 IsEmpty]: Start isEmpty. Operand 6656 states and 7064 transitions. [2019-12-07 17:19:17,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2019-12-07 17:19:17,120 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:19:17,121 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:19:17,321 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:19:17,322 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:19:17,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:19:17,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1841661433, now seen corresponding path program 1 times [2019-12-07 17:19:17,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:19:17,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611157369] [2019-12-07 17:19:17,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:19:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 81 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:19:18,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611157369] [2019-12-07 17:19:18,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102406070] [2019-12-07 17:19:18,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/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-12-07 17:19:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:18,365 INFO L264 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:19:18,369 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:19:18,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:19:18,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:19:18,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:19:18,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:19:18,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:19:18,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:19:18,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:19:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2019-12-07 17:19:18,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:19:18,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2019-12-07 17:19:18,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070921161] [2019-12-07 17:19:18,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:19:18,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:19:18,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:19:18,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:19:18,883 INFO L87 Difference]: Start difference. First operand 6656 states and 7064 transitions. Second operand 3 states. [2019-12-07 17:19:38,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:19:38,741 INFO L93 Difference]: Finished difference Result 17214 states and 18273 transitions. [2019-12-07 17:19:38,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:19:38,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 685 [2019-12-07 17:19:38,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:19:38,747 INFO L225 Difference]: With dead ends: 17214 [2019-12-07 17:19:38,748 INFO L226 Difference]: Without dead ends: 10261 [2019-12-07 17:19:38,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 684 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:19:38,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10261 states. [2019-12-07 17:19:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10261 to 9650. [2019-12-07 17:19:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9650 states. [2019-12-07 17:19:38,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9650 states to 9650 states and 10210 transitions. [2019-12-07 17:19:38,820 INFO L78 Accepts]: Start accepts. Automaton has 9650 states and 10210 transitions. Word has length 685 [2019-12-07 17:19:38,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:19:38,820 INFO L462 AbstractCegarLoop]: Abstraction has 9650 states and 10210 transitions. [2019-12-07 17:19:38,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:19:38,821 INFO L276 IsEmpty]: Start isEmpty. Operand 9650 states and 10210 transitions. [2019-12-07 17:19:38,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2019-12-07 17:19:38,827 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:19:38,827 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 17:19:39,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:19:39,028 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:19:39,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:19:39,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1459953853, now seen corresponding path program 1 times [2019-12-07 17:19:39,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:19:39,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435766079] [2019-12-07 17:19:39,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:19:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 0 proven. 634 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:19:41,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435766079] [2019-12-07 17:19:41,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180837322] [2019-12-07 17:19:41,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/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-12-07 17:19:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:41,413 INFO L264 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:19:41,419 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:19:41,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:19:41,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:19:43,516 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-12-07 17:19:43,948 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-12-07 17:19:43,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:19:43,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 18 [2019-12-07 17:19:43,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147187782] [2019-12-07 17:19:43,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:19:43,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:19:43,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:19:43,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:19:43,950 INFO L87 Difference]: Start difference. First operand 9650 states and 10210 transitions. Second operand 4 states. [2019-12-07 17:20:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:20:12,783 INFO L93 Difference]: Finished difference Result 21098 states and 22410 transitions. [2019-12-07 17:20:12,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:20:12,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 711 [2019-12-07 17:20:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:20:12,790 INFO L225 Difference]: With dead ends: 21098 [2019-12-07 17:20:12,790 INFO L226 Difference]: Without dead ends: 11450 [2019-12-07 17:20:12,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 709 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:20:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11450 states. [2019-12-07 17:20:12,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11450 to 10553. [2019-12-07 17:20:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10553 states. [2019-12-07 17:20:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10553 states to 10553 states and 11123 transitions. [2019-12-07 17:20:12,866 INFO L78 Accepts]: Start accepts. Automaton has 10553 states and 11123 transitions. Word has length 711 [2019-12-07 17:20:12,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:20:12,866 INFO L462 AbstractCegarLoop]: Abstraction has 10553 states and 11123 transitions. [2019-12-07 17:20:12,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:20:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 10553 states and 11123 transitions. [2019-12-07 17:20:12,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2019-12-07 17:20:12,875 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:20:12,875 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:20:13,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:20:13,076 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:20:13,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:20:13,077 INFO L82 PathProgramCache]: Analyzing trace with hash 137255046, now seen corresponding path program 1 times [2019-12-07 17:20:13,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:20:13,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751083663] [2019-12-07 17:20:13,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:20:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:20:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1041 backedges. 802 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-12-07 17:20:13,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751083663] [2019-12-07 17:20:13,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:20:13,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:20:13,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624376745] [2019-12-07 17:20:13,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:20:13,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:20:13,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:20:13,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:20:13,702 INFO L87 Difference]: Start difference. First operand 10553 states and 11123 transitions. Second operand 6 states. [2019-12-07 17:20:14,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:20:14,790 INFO L93 Difference]: Finished difference Result 21238 states and 22378 transitions. [2019-12-07 17:20:14,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:20:14,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 780 [2019-12-07 17:20:14,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:20:14,798 INFO L225 Difference]: With dead ends: 21238 [2019-12-07 17:20:14,798 INFO L226 Difference]: Without dead ends: 10687 [2019-12-07 17:20:14,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:20:14,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10687 states. [2019-12-07 17:20:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10687 to 10553. [2019-12-07 17:20:14,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10553 states. [2019-12-07 17:20:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10553 states to 10553 states and 11063 transitions. [2019-12-07 17:20:14,882 INFO L78 Accepts]: Start accepts. Automaton has 10553 states and 11063 transitions. Word has length 780 [2019-12-07 17:20:14,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:20:14,882 INFO L462 AbstractCegarLoop]: Abstraction has 10553 states and 11063 transitions. [2019-12-07 17:20:14,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:20:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 10553 states and 11063 transitions. [2019-12-07 17:20:14,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2019-12-07 17:20:14,893 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:20:14,894 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:20:14,894 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:20:14,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:20:14,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1653832397, now seen corresponding path program 1 times [2019-12-07 17:20:14,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:20:14,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906133975] [2019-12-07 17:20:14,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:20:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:20:15,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 682 proven. 171 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-12-07 17:20:15,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906133975] [2019-12-07 17:20:15,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226865006] [2019-12-07 17:20:15,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/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-12-07 17:20:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:20:16,016 INFO L264 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:20:16,021 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:20:16,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:16,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:17,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2019-12-07 17:20:17,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:20:17,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-12-07 17:20:17,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939239269] [2019-12-07 17:20:17,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:20:17,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:20:17,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:20:17,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:20:17,109 INFO L87 Difference]: Start difference. First operand 10553 states and 11063 transitions. Second operand 4 states. [2019-12-07 17:20:19,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:20:19,480 INFO L93 Difference]: Finished difference Result 26804 states and 28155 transitions. [2019-12-07 17:20:19,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:20:19,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 838 [2019-12-07 17:20:19,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:20:19,490 INFO L225 Difference]: With dead ends: 26804 [2019-12-07 17:20:19,490 INFO L226 Difference]: Without dead ends: 16253 [2019-12-07 17:20:19,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 837 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:20:19,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16253 states. [2019-12-07 17:20:19,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16253 to 14152. [2019-12-07 17:20:19,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14152 states. [2019-12-07 17:20:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14152 states to 14152 states and 14747 transitions. [2019-12-07 17:20:19,594 INFO L78 Accepts]: Start accepts. Automaton has 14152 states and 14747 transitions. Word has length 838 [2019-12-07 17:20:19,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:20:19,595 INFO L462 AbstractCegarLoop]: Abstraction has 14152 states and 14747 transitions. [2019-12-07 17:20:19,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:20:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 14152 states and 14747 transitions. [2019-12-07 17:20:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2019-12-07 17:20:19,608 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:20:19,609 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:20:19,809 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:20:19,809 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:20:19,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:20:19,810 INFO L82 PathProgramCache]: Analyzing trace with hash -293567428, now seen corresponding path program 1 times [2019-12-07 17:20:19,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:20:19,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624116599] [2019-12-07 17:20:19,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:20:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:20:21,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 609 proven. 391 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-12-07 17:20:21,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624116599] [2019-12-07 17:20:21,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613374537] [2019-12-07 17:20:21,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/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-12-07 17:20:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:20:22,015 INFO L264 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:20:22,022 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:20:22,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:20:22,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:22,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:22,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:22,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:22,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:22,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:22,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:22,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:22,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:22,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:22,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:22,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:22,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:22,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 710 proven. 178 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-12-07 17:20:23,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:20:23,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 14 [2019-12-07 17:20:23,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116625541] [2019-12-07 17:20:23,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:20:23,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:20:23,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:20:23,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:20:23,686 INFO L87 Difference]: Start difference. First operand 14152 states and 14747 transitions. Second operand 14 states. [2019-12-07 17:20:42,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:20:42,332 INFO L93 Difference]: Finished difference Result 46957 states and 48924 transitions. [2019-12-07 17:20:42,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 17:20:42,333 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 887 [2019-12-07 17:20:42,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:20:42,363 INFO L225 Difference]: With dead ends: 46957 [2019-12-07 17:20:42,363 INFO L226 Difference]: Without dead ends: 33106 [2019-12-07 17:20:42,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 907 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=408, Invalid=1484, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 17:20:42,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33106 states. [2019-12-07 17:20:42,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33106 to 16554. [2019-12-07 17:20:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16554 states. [2019-12-07 17:20:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16554 states to 16554 states and 17208 transitions. [2019-12-07 17:20:42,542 INFO L78 Accepts]: Start accepts. Automaton has 16554 states and 17208 transitions. Word has length 887 [2019-12-07 17:20:42,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:20:42,543 INFO L462 AbstractCegarLoop]: Abstraction has 16554 states and 17208 transitions. [2019-12-07 17:20:42,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:20:42,543 INFO L276 IsEmpty]: Start isEmpty. Operand 16554 states and 17208 transitions. [2019-12-07 17:20:42,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 933 [2019-12-07 17:20:42,563 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:20:42,563 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:20:42,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:20:42,764 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:20:42,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:20:42,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1949021602, now seen corresponding path program 1 times [2019-12-07 17:20:42,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:20:42,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379624034] [2019-12-07 17:20:42,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:20:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:20:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 793 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-12-07 17:20:43,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379624034] [2019-12-07 17:20:43,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:20:43,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:20:43,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438092033] [2019-12-07 17:20:43,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:20:43,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:20:43,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:20:43,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:20:43,492 INFO L87 Difference]: Start difference. First operand 16554 states and 17208 transitions. Second operand 5 states. [2019-12-07 17:20:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:20:45,451 INFO L93 Difference]: Finished difference Result 37890 states and 39652 transitions. [2019-12-07 17:20:45,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:20:45,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 932 [2019-12-07 17:20:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:20:45,466 INFO L225 Difference]: With dead ends: 37890 [2019-12-07 17:20:45,466 INFO L226 Difference]: Without dead ends: 24034 [2019-12-07 17:20:45,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:20:45,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24034 states. [2019-12-07 17:20:45,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24034 to 19243. [2019-12-07 17:20:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19243 states. [2019-12-07 17:20:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19243 states to 19243 states and 20042 transitions. [2019-12-07 17:20:45,634 INFO L78 Accepts]: Start accepts. Automaton has 19243 states and 20042 transitions. Word has length 932 [2019-12-07 17:20:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:20:45,635 INFO L462 AbstractCegarLoop]: Abstraction has 19243 states and 20042 transitions. [2019-12-07 17:20:45,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:20:45,635 INFO L276 IsEmpty]: Start isEmpty. Operand 19243 states and 20042 transitions. [2019-12-07 17:20:45,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 938 [2019-12-07 17:20:45,650 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:20:45,650 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:20:45,650 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:20:45,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:20:45,651 INFO L82 PathProgramCache]: Analyzing trace with hash -767322243, now seen corresponding path program 1 times [2019-12-07 17:20:45,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:20:45,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460042758] [2019-12-07 17:20:45,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:20:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:20:46,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 742 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-12-07 17:20:46,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460042758] [2019-12-07 17:20:46,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:20:46,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:20:46,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944458457] [2019-12-07 17:20:46,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:20:46,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:20:46,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:20:46,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:20:46,166 INFO L87 Difference]: Start difference. First operand 19243 states and 20042 transitions. Second operand 3 states. [2019-12-07 17:20:47,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:20:47,277 INFO L93 Difference]: Finished difference Result 37579 states and 39226 transitions. [2019-12-07 17:20:47,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:20:47,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 937 [2019-12-07 17:20:47,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:20:47,290 INFO L225 Difference]: With dead ends: 37579 [2019-12-07 17:20:47,291 INFO L226 Difference]: Without dead ends: 21034 [2019-12-07 17:20:47,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:20:47,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21034 states. [2019-12-07 17:20:47,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21034 to 20436. [2019-12-07 17:20:47,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20436 states. [2019-12-07 17:20:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20436 states to 20436 states and 21247 transitions. [2019-12-07 17:20:47,451 INFO L78 Accepts]: Start accepts. Automaton has 20436 states and 21247 transitions. Word has length 937 [2019-12-07 17:20:47,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:20:47,451 INFO L462 AbstractCegarLoop]: Abstraction has 20436 states and 21247 transitions. [2019-12-07 17:20:47,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:20:47,451 INFO L276 IsEmpty]: Start isEmpty. Operand 20436 states and 21247 transitions. [2019-12-07 17:20:47,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 959 [2019-12-07 17:20:47,488 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:20:47,489 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:20:47,489 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:20:47,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:20:47,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1550264415, now seen corresponding path program 1 times [2019-12-07 17:20:47,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:20:47,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906883196] [2019-12-07 17:20:47,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:20:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:20:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 792 proven. 0 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-12-07 17:20:48,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906883196] [2019-12-07 17:20:48,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:20:48,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:20:48,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767955934] [2019-12-07 17:20:48,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:20:48,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:20:48,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:20:48,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:20:48,256 INFO L87 Difference]: Start difference. First operand 20436 states and 21247 transitions. Second operand 5 states. [2019-12-07 17:20:50,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:20:50,627 INFO L93 Difference]: Finished difference Result 26733 states and 27771 transitions. [2019-12-07 17:20:50,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:20:50,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 958 [2019-12-07 17:20:50,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:20:50,647 INFO L225 Difference]: With dead ends: 26733 [2019-12-07 17:20:50,647 INFO L226 Difference]: Without dead ends: 26731 [2019-12-07 17:20:50,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:20:50,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26731 states. [2019-12-07 17:20:50,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26731 to 20735. [2019-12-07 17:20:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20735 states. [2019-12-07 17:20:50,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20735 states to 20735 states and 21594 transitions. [2019-12-07 17:20:50,835 INFO L78 Accepts]: Start accepts. Automaton has 20735 states and 21594 transitions. Word has length 958 [2019-12-07 17:20:50,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:20:50,835 INFO L462 AbstractCegarLoop]: Abstraction has 20735 states and 21594 transitions. [2019-12-07 17:20:50,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:20:50,836 INFO L276 IsEmpty]: Start isEmpty. Operand 20735 states and 21594 transitions. [2019-12-07 17:20:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1090 [2019-12-07 17:20:50,850 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:20:50,851 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:20:50,851 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:20:50,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:20:50,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1931423885, now seen corresponding path program 1 times [2019-12-07 17:20:50,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:20:50,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499261292] [2019-12-07 17:20:50,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:20:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:20:52,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 1250 proven. 171 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2019-12-07 17:20:52,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499261292] [2019-12-07 17:20:52,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116005481] [2019-12-07 17:20:52,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/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-12-07 17:20:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:20:52,331 INFO L264 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:20:52,337 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:20:52,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:52,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:52,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:52,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:20:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 1520 proven. 266 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-12-07 17:20:55,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:20:55,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2019-12-07 17:20:55,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431194601] [2019-12-07 17:20:55,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:20:55,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:20:55,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:20:55,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:20:55,185 INFO L87 Difference]: Start difference. First operand 20735 states and 21594 transitions. Second operand 10 states. [2019-12-07 17:21:16,864 WARN L192 SmtUtils]: Spent 608.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-12-07 17:21:18,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:21:18,985 INFO L93 Difference]: Finished difference Result 59804 states and 62343 transitions. [2019-12-07 17:21:18,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 17:21:18,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1089 [2019-12-07 17:21:18,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:21:18,986 INFO L225 Difference]: With dead ends: 59804 [2019-12-07 17:21:18,986 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:21:18,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1125 GetRequests, 1102 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2019-12-07 17:21:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:21:18,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:21:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:21:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:21:18,996 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1089 [2019-12-07 17:21:18,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:21:18,996 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:21:18,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:21:18,996 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:21:18,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:21:19,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:21:19,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 17:21:20,154 WARN L192 SmtUtils]: Spent 948.00 ms on a formula simplification. DAG size of input: 707 DAG size of output: 562 [2019-12-07 17:21:20,985 WARN L192 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 706 DAG size of output: 563 [2019-12-07 17:21:21,570 WARN L192 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 601 DAG size of output: 455 [2019-12-07 17:21:31,335 WARN L192 SmtUtils]: Spent 9.76 s on a formula simplification. DAG size of input: 531 DAG size of output: 158 [2019-12-07 17:21:40,205 WARN L192 SmtUtils]: Spent 8.87 s on a formula simplification. DAG size of input: 533 DAG size of output: 158 [2019-12-07 17:21:47,697 WARN L192 SmtUtils]: Spent 7.49 s on a formula simplification. DAG size of input: 430 DAG size of output: 153 [2019-12-07 17:21:47,701 INFO L246 CegarLoopResult]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,701 INFO L246 CegarLoopResult]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,701 INFO L246 CegarLoopResult]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,702 INFO L246 CegarLoopResult]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,702 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 17:21:47,702 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,702 INFO L246 CegarLoopResult]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,702 INFO L246 CegarLoopResult]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,702 INFO L246 CegarLoopResult]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,702 INFO L246 CegarLoopResult]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,702 INFO L246 CegarLoopResult]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,702 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 17:21:47,702 INFO L246 CegarLoopResult]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,702 INFO L246 CegarLoopResult]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,702 INFO L246 CegarLoopResult]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,703 INFO L246 CegarLoopResult]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-12-07 17:21:47,703 INFO L246 CegarLoopResult]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,703 INFO L246 CegarLoopResult]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,703 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 17:21:47,703 INFO L246 CegarLoopResult]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,703 INFO L246 CegarLoopResult]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,703 INFO L246 CegarLoopResult]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,703 INFO L246 CegarLoopResult]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,703 INFO L246 CegarLoopResult]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,703 INFO L246 CegarLoopResult]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,703 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 17:21:47,703 INFO L246 CegarLoopResult]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,704 INFO L246 CegarLoopResult]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,704 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,704 INFO L246 CegarLoopResult]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,704 INFO L246 CegarLoopResult]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-12-07 17:21:47,704 INFO L246 CegarLoopResult]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-12-07 17:21:47,704 INFO L246 CegarLoopResult]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,704 INFO L246 CegarLoopResult]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,704 INFO L246 CegarLoopResult]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,704 INFO L246 CegarLoopResult]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,704 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 17:21:47,704 INFO L246 CegarLoopResult]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-12-07 17:21:47,704 INFO L246 CegarLoopResult]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,704 INFO L246 CegarLoopResult]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,705 INFO L246 CegarLoopResult]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,705 INFO L246 CegarLoopResult]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,705 INFO L246 CegarLoopResult]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,705 INFO L246 CegarLoopResult]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 17:21:47,705 INFO L246 CegarLoopResult]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,705 INFO L246 CegarLoopResult]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 17:21:47,705 INFO L246 CegarLoopResult]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 17:21:47,705 INFO L246 CegarLoopResult]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 17:21:47,705 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 17:21:47,705 INFO L246 CegarLoopResult]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,705 INFO L246 CegarLoopResult]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,705 INFO L246 CegarLoopResult]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,706 INFO L246 CegarLoopResult]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,706 INFO L246 CegarLoopResult]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,706 INFO L246 CegarLoopResult]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-12-07 17:21:47,706 INFO L246 CegarLoopResult]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,706 INFO L246 CegarLoopResult]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,706 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 17:21:47,706 INFO L246 CegarLoopResult]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,706 INFO L246 CegarLoopResult]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-12-07 17:21:47,706 INFO L246 CegarLoopResult]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,706 INFO L246 CegarLoopResult]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,706 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,706 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 17:21:47,707 INFO L246 CegarLoopResult]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,707 INFO L246 CegarLoopResult]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 17:21:47,707 INFO L246 CegarLoopResult]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 17:21:47,707 INFO L246 CegarLoopResult]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-12-07 17:21:47,707 INFO L246 CegarLoopResult]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-12-07 17:21:47,707 INFO L246 CegarLoopResult]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 17:21:47,707 INFO L246 CegarLoopResult]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 17:21:47,707 INFO L246 CegarLoopResult]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,707 INFO L246 CegarLoopResult]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,707 INFO L246 CegarLoopResult]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,707 INFO L246 CegarLoopResult]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,708 INFO L246 CegarLoopResult]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-12-07 17:21:47,708 INFO L246 CegarLoopResult]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-12-07 17:21:47,708 INFO L246 CegarLoopResult]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,708 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 17:21:47,708 INFO L246 CegarLoopResult]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,708 INFO L246 CegarLoopResult]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,708 INFO L246 CegarLoopResult]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,708 INFO L246 CegarLoopResult]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,708 INFO L246 CegarLoopResult]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,708 INFO L246 CegarLoopResult]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,708 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 17:21:47,708 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 17:21:47,709 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 166) no Hoare annotation was computed. [2019-12-07 17:21:47,709 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,709 INFO L246 CegarLoopResult]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,709 INFO L246 CegarLoopResult]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,709 INFO L246 CegarLoopResult]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,709 INFO L246 CegarLoopResult]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,709 INFO L246 CegarLoopResult]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 17:21:47,709 INFO L246 CegarLoopResult]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 17:21:47,709 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,709 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 17:21:47,709 INFO L246 CegarLoopResult]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-12-07 17:21:47,709 INFO L246 CegarLoopResult]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-12-07 17:21:47,710 INFO L246 CegarLoopResult]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,710 INFO L246 CegarLoopResult]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-12-07 17:21:47,710 INFO L246 CegarLoopResult]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-12-07 17:21:47,710 INFO L246 CegarLoopResult]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,710 INFO L246 CegarLoopResult]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,710 INFO L246 CegarLoopResult]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,710 INFO L246 CegarLoopResult]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,710 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 17:21:47,710 INFO L246 CegarLoopResult]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-12-07 17:21:47,710 INFO L246 CegarLoopResult]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,710 INFO L246 CegarLoopResult]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,710 INFO L246 CegarLoopResult]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,711 INFO L246 CegarLoopResult]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 17:21:47,711 INFO L246 CegarLoopResult]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 17:21:47,711 INFO L246 CegarLoopResult]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,711 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 17:21:47,711 INFO L246 CegarLoopResult]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,711 INFO L246 CegarLoopResult]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,711 INFO L246 CegarLoopResult]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,711 INFO L246 CegarLoopResult]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,711 INFO L246 CegarLoopResult]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,711 INFO L246 CegarLoopResult]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,711 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 17:21:47,711 INFO L246 CegarLoopResult]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,712 INFO L246 CegarLoopResult]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,712 INFO L246 CegarLoopResult]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-12-07 17:21:47,712 INFO L246 CegarLoopResult]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,712 INFO L246 CegarLoopResult]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,712 INFO L246 CegarLoopResult]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,712 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,712 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 17:21:47,712 INFO L246 CegarLoopResult]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,712 INFO L246 CegarLoopResult]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,712 INFO L246 CegarLoopResult]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,712 INFO L246 CegarLoopResult]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,713 INFO L246 CegarLoopResult]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,713 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 17:21:47,713 INFO L246 CegarLoopResult]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,713 INFO L246 CegarLoopResult]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,713 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,713 INFO L246 CegarLoopResult]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,713 INFO L246 CegarLoopResult]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-12-07 17:21:47,713 INFO L246 CegarLoopResult]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,713 INFO L246 CegarLoopResult]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,713 INFO L246 CegarLoopResult]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,713 INFO L246 CegarLoopResult]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-12-07 17:21:47,713 INFO L246 CegarLoopResult]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-12-07 17:21:47,714 INFO L246 CegarLoopResult]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,714 INFO L246 CegarLoopResult]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,714 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 17:21:47,714 INFO L246 CegarLoopResult]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,714 INFO L246 CegarLoopResult]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,714 INFO L246 CegarLoopResult]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,714 INFO L246 CegarLoopResult]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,714 INFO L246 CegarLoopResult]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,714 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 17:21:47,714 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,714 INFO L246 CegarLoopResult]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,714 INFO L246 CegarLoopResult]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,714 INFO L246 CegarLoopResult]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,715 INFO L246 CegarLoopResult]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,715 INFO L246 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-12-07 17:21:47,715 INFO L246 CegarLoopResult]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,715 INFO L246 CegarLoopResult]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,715 INFO L246 CegarLoopResult]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-12-07 17:21:47,715 INFO L246 CegarLoopResult]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,715 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 17:21:47,715 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 17:21:47,715 INFO L246 CegarLoopResult]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,715 INFO L246 CegarLoopResult]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,715 INFO L246 CegarLoopResult]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,715 INFO L246 CegarLoopResult]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,716 INFO L246 CegarLoopResult]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,716 INFO L246 CegarLoopResult]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 17:21:47,716 INFO L246 CegarLoopResult]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 17:21:47,716 INFO L246 CegarLoopResult]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,716 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 17:21:47,716 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 17:21:47,716 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 17:21:47,716 INFO L246 CegarLoopResult]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,716 INFO L246 CegarLoopResult]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,716 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,716 INFO L246 CegarLoopResult]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,716 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,717 INFO L246 CegarLoopResult]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-12-07 17:21:47,717 INFO L246 CegarLoopResult]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-12-07 17:21:47,717 INFO L246 CegarLoopResult]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 17:21:47,717 INFO L246 CegarLoopResult]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 17:21:47,717 INFO L246 CegarLoopResult]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,717 INFO L246 CegarLoopResult]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,717 INFO L246 CegarLoopResult]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,717 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 17:21:47,717 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 17:21:47,717 INFO L246 CegarLoopResult]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,717 INFO L246 CegarLoopResult]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-12-07 17:21:47,717 INFO L246 CegarLoopResult]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,718 INFO L246 CegarLoopResult]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,718 INFO L246 CegarLoopResult]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,718 INFO L246 CegarLoopResult]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,718 INFO L246 CegarLoopResult]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-12-07 17:21:47,718 INFO L246 CegarLoopResult]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-12-07 17:21:47,718 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 17:21:47,718 INFO L246 CegarLoopResult]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,718 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 17:21:47,718 INFO L246 CegarLoopResult]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,718 INFO L246 CegarLoopResult]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,718 INFO L246 CegarLoopResult]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,718 INFO L246 CegarLoopResult]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,718 INFO L246 CegarLoopResult]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,719 INFO L246 CegarLoopResult]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,719 INFO L246 CegarLoopResult]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,719 INFO L246 CegarLoopResult]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,719 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 17:21:47,719 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 17:21:47,719 INFO L246 CegarLoopResult]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-12-07 17:21:47,719 INFO L246 CegarLoopResult]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-12-07 17:21:47,719 INFO L246 CegarLoopResult]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,719 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,719 INFO L246 CegarLoopResult]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,719 INFO L246 CegarLoopResult]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,720 INFO L242 CegarLoopResult]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse24 (+ ~a4~0 86)) (.cse20 (+ ~a0~0 44)) (.cse25 (+ ~a0~0 98))) (let ((.cse10 (= 1 ~a2~0)) (.cse22 (+ ~a0~0 61)) (.cse9 (<= .cse25 0)) (.cse16 (<= (+ ~a29~0 (* 5 ~a0~0)) 599248)) (.cse4 (< 43 ~a29~0)) (.cse18 (<= 0 .cse20)) (.cse2 (not (= 2 ~a2~0))) (.cse21 (<= .cse24 0))) (let ((.cse12 (or .cse18 (and .cse21 .cse2) (and .cse21 (< 0 .cse25)))) (.cse11 (< 0 (+ ~a0~0 147))) (.cse5 (or .cse9 (and .cse16 .cse4))) (.cse6 (< 0 .cse24)) (.cse7 (<= ~a2~0 2)) (.cse13 (<= ~a29~0 43)) (.cse0 (<= 2 ~a2~0)) (.cse15 (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)))))) (.cse14 (<= 0 (+ ~a0~0 600000))) (.cse8 (<= .cse22 0)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse17 (or (and .cse10 .cse18) (and .cse21 .cse10))) (.cse3 (<= ~a29~0 599998))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse11 .cse8) (and .cse12 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse11) (and .cse1 .cse13 (= 3 ~a2~0) .cse8) (and .cse0 .cse1 .cse13 .cse12) (and .cse1 .cse6 .cse10 .cse13 (< 0 (+ ~a29~0 144)) .cse14) (and .cse0 .cse1 .cse7 .cse15) (and .cse1 .cse10 .cse3 .cse16 .cse14 .cse8 .cse4) (and .cse1 .cse10 .cse11 (<= (+ ~a29~0 6908) 0) .cse8) (and .cse0 .cse7 (exists ((v_~a0~0_825 Int)) (and (< (* 10 v_~a0~0_825) 0) (<= (+ ~a0~0 386229) (* 5 (div (* v_~a0~0_825 10) 4))) (<= (+ v_~a0~0_825 61) 0) (not (= 0 (mod (* v_~a0~0_825 2) 4))))) .cse14) (and .cse0 .cse1 .cse2 .cse5 .cse3 .cse14) (and .cse0 .cse1 .cse6 .cse7 .cse13 .cse8) (and (<= (+ ~a4~0 89) 0) .cse17 .cse18 (exists ((v_~a29~0_896 Int) (v_~a29~0_895 Int)) (let ((.cse19 (div v_~a29~0_896 5))) (and (< 43 v_~a29~0_895) (<= 0 v_~a29~0_896) (<= ~a29~0 (+ (mod (+ .cse19 11) 29) 3)) (<= (+ (mod v_~a29~0_895 299978) 300022) v_~a29~0_896) (<= 0 v_~a29~0_895) (<= 0 (+ .cse19 479874))))) (<= 0 (+ ~a29~0 127)) (<= .cse20 0)) (and .cse1 .cse14 .cse8 (= 4 ~a2~0)) (and .cse0 .cse21 .cse3 (< 0 .cse22)) (and .cse0 .cse1 .cse15 .cse14 .cse8) (and .cse1 .cse17 (<= 146 ~a0~0) .cse3))))) [2019-12-07 17:21:47,720 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 17:21:47,720 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 17:21:47,720 INFO L246 CegarLoopResult]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,720 INFO L246 CegarLoopResult]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,720 INFO L246 CegarLoopResult]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,720 INFO L246 CegarLoopResult]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,720 INFO L246 CegarLoopResult]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,720 INFO L246 CegarLoopResult]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,720 INFO L246 CegarLoopResult]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,720 INFO L246 CegarLoopResult]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 17:21:47,720 INFO L246 CegarLoopResult]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,720 INFO L246 CegarLoopResult]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 17:21:47,721 INFO L249 CegarLoopResult]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-12-07 17:21:47,721 INFO L246 CegarLoopResult]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,721 INFO L246 CegarLoopResult]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-12-07 17:21:47,721 INFO L246 CegarLoopResult]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-12-07 17:21:47,721 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 17:21:47,721 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 17:21:47,721 INFO L246 CegarLoopResult]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,721 INFO L246 CegarLoopResult]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,721 INFO L246 CegarLoopResult]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,721 INFO L246 CegarLoopResult]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,721 INFO L246 CegarLoopResult]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,721 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 17:21:47,721 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 17:21:47,721 INFO L246 CegarLoopResult]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,721 INFO L246 CegarLoopResult]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-12-07 17:21:47,721 INFO L246 CegarLoopResult]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-12-07 17:21:47,721 INFO L246 CegarLoopResult]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,721 INFO L246 CegarLoopResult]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,721 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,722 INFO L246 CegarLoopResult]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,722 INFO L246 CegarLoopResult]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,722 INFO L246 CegarLoopResult]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,722 INFO L242 CegarLoopResult]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse24 (+ ~a0~0 98)) (.cse25 (+ ~a4~0 86)) (.cse21 (+ ~a0~0 44))) (let ((.cse10 (= 1 ~a2~0)) (.cse20 (<= 0 .cse21)) (.cse2 (not (= 2 ~a2~0))) (.cse12 (<= .cse25 0)) (.cse9 (<= .cse24 0)) (.cse19 (<= (+ ~a29~0 (* 5 ~a0~0)) 599248)) (.cse4 (< 43 ~a29~0))) (let ((.cse14 (+ ~a29~0 144)) (.cse11 (< 0 (+ ~a0~0 147))) (.cse6 (< 0 .cse25)) (.cse7 (<= ~a2~0 2)) (.cse16 (<= ~a29~0 43)) (.cse5 (or .cse9 (and .cse19 .cse4))) (.cse15 (or .cse20 (and .cse12 .cse2) (and .cse12 (< 0 .cse24)))) (.cse13 (or (and .cse10 .cse20) (and .cse12 .cse10))) (.cse3 (<= ~a29~0 599998)) (.cse0 (<= 2 ~a2~0)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse18 (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)))))) (.cse17 (<= 0 (+ ~a0~0 600000))) (.cse8 (<= (+ ~a0~0 61) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse11 .cse8) (and .cse12 .cse13 (<= .cse14 0)) (and .cse15 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse11) (and .cse1 .cse16 (= 3 ~a2~0) .cse8) (and .cse0 .cse1 .cse16 .cse15) (and .cse1 .cse6 .cse10 .cse16 (< 0 .cse14) .cse17) (and .cse0 .cse1 .cse7 .cse18) (and .cse1 .cse10 .cse3 .cse19 .cse17 .cse8 .cse4) (and .cse1 .cse10 .cse11 (<= (+ ~a29~0 6908) 0) .cse8) (and .cse0 .cse7 (exists ((v_~a0~0_825 Int)) (and (< (* 10 v_~a0~0_825) 0) (<= (+ ~a0~0 386229) (* 5 (div (* v_~a0~0_825 10) 4))) (<= (+ v_~a0~0_825 61) 0) (not (= 0 (mod (* v_~a0~0_825 2) 4))))) .cse17) (and .cse0 .cse1 .cse6 .cse7 .cse16 .cse8) (and .cse0 .cse1 .cse2 .cse5 .cse3 .cse17) (and .cse12 .cse0 .cse3 .cse15) (and (<= (+ ~a4~0 89) 0) .cse13 .cse20 (<= .cse21 0) (exists ((v_~a29~0_896 Int) (v_~a29~0_895 Int)) (let ((.cse22 (div v_~a29~0_896 5))) (and (< 43 v_~a29~0_895) (<= 0 v_~a29~0_896) (<= ~a29~0 (+ (mod (+ .cse22 11) 29) 3)) (<= (+ (mod v_~a29~0_895 299978) 300022) v_~a29~0_896) (<= 0 v_~a29~0_895) (<= 0 (+ .cse22 479874))))) (<= 0 (+ ~a29~0 127))) (and .cse1 .cse17 .cse8 (= 4 ~a2~0)) (and .cse1 .cse13 (<= 146 ~a0~0) .cse3) (and .cse0 .cse1 .cse18 .cse17 .cse8))))) [2019-12-07 17:21:47,722 INFO L246 CegarLoopResult]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,722 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 17:21:47,722 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 17:21:47,722 INFO L246 CegarLoopResult]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,722 INFO L246 CegarLoopResult]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,722 INFO L246 CegarLoopResult]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,722 INFO L246 CegarLoopResult]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,722 INFO L246 CegarLoopResult]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,723 INFO L246 CegarLoopResult]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,723 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 17:21:47,723 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 17:21:47,723 INFO L246 CegarLoopResult]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,723 INFO L246 CegarLoopResult]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,723 INFO L246 CegarLoopResult]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-12-07 17:21:47,723 INFO L246 CegarLoopResult]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,723 INFO L246 CegarLoopResult]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,723 INFO L246 CegarLoopResult]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,723 INFO L246 CegarLoopResult]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,723 INFO L246 CegarLoopResult]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,723 INFO L246 CegarLoopResult]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,723 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 17:21:47,723 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 17:21:47,723 INFO L246 CegarLoopResult]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,723 INFO L246 CegarLoopResult]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,723 INFO L246 CegarLoopResult]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,723 INFO L246 CegarLoopResult]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,723 INFO L246 CegarLoopResult]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,724 INFO L246 CegarLoopResult]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,724 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 17:21:47,724 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 17:21:47,724 INFO L246 CegarLoopResult]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,724 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 17:21:47,724 INFO L246 CegarLoopResult]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,724 INFO L246 CegarLoopResult]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,724 INFO L246 CegarLoopResult]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,724 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,724 INFO L246 CegarLoopResult]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,724 INFO L246 CegarLoopResult]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,724 INFO L246 CegarLoopResult]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,724 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 17:21:47,724 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 17:21:47,724 INFO L246 CegarLoopResult]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,724 INFO L246 CegarLoopResult]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,724 INFO L246 CegarLoopResult]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,724 INFO L246 CegarLoopResult]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,724 INFO L246 CegarLoopResult]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,724 INFO L246 CegarLoopResult]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,725 INFO L246 CegarLoopResult]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,726 INFO L242 CegarLoopResult]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse24 (+ ~a0~0 98)) (.cse25 (+ ~a4~0 86)) (.cse21 (+ ~a0~0 44))) (let ((.cse10 (= 1 ~a2~0)) (.cse20 (<= 0 .cse21)) (.cse2 (not (= 2 ~a2~0))) (.cse12 (<= .cse25 0)) (.cse9 (<= .cse24 0)) (.cse19 (<= (+ ~a29~0 (* 5 ~a0~0)) 599248)) (.cse4 (< 43 ~a29~0))) (let ((.cse14 (+ ~a29~0 144)) (.cse11 (< 0 (+ ~a0~0 147))) (.cse6 (< 0 .cse25)) (.cse7 (<= ~a2~0 2)) (.cse16 (<= ~a29~0 43)) (.cse5 (or .cse9 (and .cse19 .cse4))) (.cse15 (or .cse20 (and .cse12 .cse2) (and .cse12 (< 0 .cse24)))) (.cse13 (or (and .cse10 .cse20) (and .cse12 .cse10))) (.cse3 (<= ~a29~0 599998)) (.cse0 (<= 2 ~a2~0)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse18 (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)))))) (.cse17 (<= 0 (+ ~a0~0 600000))) (.cse8 (<= (+ ~a0~0 61) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse11 .cse8) (and .cse12 .cse13 (<= .cse14 0)) (and .cse15 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse11) (and .cse1 .cse16 (= 3 ~a2~0) .cse8) (and .cse0 .cse1 .cse16 .cse15) (and .cse1 .cse6 .cse10 .cse16 (< 0 .cse14) .cse17) (and .cse0 .cse1 .cse7 .cse18) (and .cse1 .cse10 .cse3 .cse19 .cse17 .cse8 .cse4) (and .cse1 .cse10 .cse11 (<= (+ ~a29~0 6908) 0) .cse8) (and .cse0 .cse7 (exists ((v_~a0~0_825 Int)) (and (< (* 10 v_~a0~0_825) 0) (<= (+ ~a0~0 386229) (* 5 (div (* v_~a0~0_825 10) 4))) (<= (+ v_~a0~0_825 61) 0) (not (= 0 (mod (* v_~a0~0_825 2) 4))))) .cse17) (and .cse0 .cse1 .cse6 .cse7 .cse16 .cse8) (and .cse0 .cse1 .cse2 .cse5 .cse3 .cse17) (and .cse12 .cse0 .cse3 .cse15) (and (<= (+ ~a4~0 89) 0) .cse13 .cse20 (<= .cse21 0) (exists ((v_~a29~0_896 Int) (v_~a29~0_895 Int)) (let ((.cse22 (div v_~a29~0_896 5))) (and (< 43 v_~a29~0_895) (<= 0 v_~a29~0_896) (<= ~a29~0 (+ (mod (+ .cse22 11) 29) 3)) (<= (+ (mod v_~a29~0_895 299978) 300022) v_~a29~0_896) (<= 0 v_~a29~0_895) (<= 0 (+ .cse22 479874))))) (<= 0 (+ ~a29~0 127))) (and .cse1 .cse17 .cse8 (= 4 ~a2~0)) (and .cse1 .cse13 (<= 146 ~a0~0) .cse3) (and .cse0 .cse1 .cse18 .cse17 .cse8))))) [2019-12-07 17:21:47,726 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 17:21:47,726 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 17:21:47,726 INFO L246 CegarLoopResult]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,726 INFO L246 CegarLoopResult]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,726 INFO L246 CegarLoopResult]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,726 INFO L246 CegarLoopResult]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,726 INFO L246 CegarLoopResult]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,726 INFO L246 CegarLoopResult]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,726 INFO L246 CegarLoopResult]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,726 INFO L246 CegarLoopResult]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,726 INFO L246 CegarLoopResult]: For program point L205(line 205) no Hoare annotation was computed. [2019-12-07 17:21:47,726 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 17:21:47,726 INFO L246 CegarLoopResult]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,727 INFO L246 CegarLoopResult]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 17:21:47,727 INFO L246 CegarLoopResult]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 17:21:47,727 INFO L246 CegarLoopResult]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,727 INFO L246 CegarLoopResult]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,727 INFO L246 CegarLoopResult]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,727 INFO L246 CegarLoopResult]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,727 INFO L246 CegarLoopResult]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,727 INFO L246 CegarLoopResult]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-12-07 17:21:47,727 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 17:21:47,727 INFO L246 CegarLoopResult]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,727 INFO L246 CegarLoopResult]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,727 INFO L246 CegarLoopResult]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,727 INFO L246 CegarLoopResult]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,727 INFO L246 CegarLoopResult]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-12-07 17:21:47,727 INFO L246 CegarLoopResult]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-12-07 17:21:47,727 INFO L246 CegarLoopResult]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 17:21:47,727 INFO L246 CegarLoopResult]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,727 INFO L246 CegarLoopResult]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 17:21:47,727 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,728 INFO L246 CegarLoopResult]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-12-07 17:21:47,729 INFO L246 CegarLoopResult]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 17:21:47,730 INFO L246 CegarLoopResult]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 17:21:47,731 INFO L246 CegarLoopResult]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,731 INFO L246 CegarLoopResult]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,731 INFO L246 CegarLoopResult]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 17:21:47,731 INFO L246 CegarLoopResult]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 17:21:47,731 INFO L246 CegarLoopResult]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-12-07 17:21:47,739 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,740 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,740 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,740 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,740 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,752 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:21:47 BoogieIcfgContainer [2019-12-07 17:21:47,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:21:47,774 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:21:47,774 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:21:47,775 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:21:47,775 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:18:46" (3/4) ... [2019-12-07 17:21:47,777 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:21:47,802 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 17:21:47,805 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 17:21:47,825 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((2 <= a2 && a4 + 42 <= 0) && !(2 == a2)) && a29 <= 599998) && 43 < a29) || (((((2 <= a2 && a4 + 42 <= 0) && (a0 + 98 <= 0 || (a29 + 5 * a0 <= 599248 && 43 < a29))) && 0 < a4 + 86) && a2 <= 2) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && a0 + 98 <= 0) && 1 == a2) && 0 < a0 + 147) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a0 + 147)) || (((a4 + 42 <= 0 && a29 <= 43) && 3 == a2) && a0 + 61 <= 0)) || (((2 <= a2 && a4 + 42 <= 0) && a29 <= 43) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (((((a4 + 42 <= 0 && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 600000)) || (((2 <= a2 && a4 + 42 <= 0) && a2 <= 2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14))) || ((((((a4 + 42 <= 0 && 1 == a2) && a29 <= 599998) && a29 + 5 * a0 <= 599248) && 0 <= a0 + 600000) && a0 + 61 <= 0) && 43 < a29)) || ((((a4 + 42 <= 0 && 1 == a2) && 0 < a0 + 147) && a29 + 6908 <= 0) && a0 + 61 <= 0)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a0~0_825 : int :: ((10 * v_~a0~0_825 < 0 && a0 + 386229 <= 5 * (v_~a0~0_825 * 10 / 4)) && v_~a0~0_825 + 61 <= 0) && !(0 == v_~a0~0_825 * 2 % 4))) && 0 <= a0 + 600000)) || (((((2 <= a2 && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2) && a29 <= 43) && a0 + 61 <= 0)) || (((((2 <= a2 && a4 + 42 <= 0) && !(2 == a2)) && (a0 + 98 <= 0 || (a29 + 5 * a0 <= 599248 && 43 < a29))) && a29 <= 599998) && 0 <= a0 + 600000)) || (((a4 + 86 <= 0 && 2 <= a2) && a29 <= 599998) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a0 + 44) && a0 + 44 <= 0) && (\exists v_~a29~0_896 : int, v_~a29~0_895 : int :: ((((43 < v_~a29~0_895 && 0 <= v_~a29~0_896) && a29 <= (v_~a29~0_896 / 5 + 11) % 29 + 3) && v_~a29~0_895 % 299978 + 300022 <= v_~a29~0_896) && 0 <= v_~a29~0_895) && 0 <= v_~a29~0_896 / 5 + 479874)) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && 0 <= a0 + 600000) && a0 + 61 <= 0) && 4 == a2)) || (((a4 + 42 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 146 <= a0) && a29 <= 599998)) || ((((2 <= a2 && a4 + 42 <= 0) && (\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 <= a0 + 600000) && a0 + 61 <= 0) [2019-12-07 17:21:47,827 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((2 <= a2 && a4 + 42 <= 0) && !(2 == a2)) && a29 <= 599998) && 43 < a29) || (((((2 <= a2 && a4 + 42 <= 0) && (a0 + 98 <= 0 || (a29 + 5 * a0 <= 599248 && 43 < a29))) && 0 < a4 + 86) && a2 <= 2) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && a0 + 98 <= 0) && 1 == a2) && 0 < a0 + 147) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a0 + 147)) || (((a4 + 42 <= 0 && a29 <= 43) && 3 == a2) && a0 + 61 <= 0)) || (((2 <= a2 && a4 + 42 <= 0) && a29 <= 43) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (((((a4 + 42 <= 0 && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 600000)) || (((2 <= a2 && a4 + 42 <= 0) && a2 <= 2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14))) || ((((((a4 + 42 <= 0 && 1 == a2) && a29 <= 599998) && a29 + 5 * a0 <= 599248) && 0 <= a0 + 600000) && a0 + 61 <= 0) && 43 < a29)) || ((((a4 + 42 <= 0 && 1 == a2) && 0 < a0 + 147) && a29 + 6908 <= 0) && a0 + 61 <= 0)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a0~0_825 : int :: ((10 * v_~a0~0_825 < 0 && a0 + 386229 <= 5 * (v_~a0~0_825 * 10 / 4)) && v_~a0~0_825 + 61 <= 0) && !(0 == v_~a0~0_825 * 2 % 4))) && 0 <= a0 + 600000)) || (((((2 <= a2 && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2) && a29 <= 43) && a0 + 61 <= 0)) || (((((2 <= a2 && a4 + 42 <= 0) && !(2 == a2)) && (a0 + 98 <= 0 || (a29 + 5 * a0 <= 599248 && 43 < a29))) && a29 <= 599998) && 0 <= a0 + 600000)) || (((a4 + 86 <= 0 && 2 <= a2) && a29 <= 599998) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a0 + 44) && a0 + 44 <= 0) && (\exists v_~a29~0_896 : int, v_~a29~0_895 : int :: ((((43 < v_~a29~0_895 && 0 <= v_~a29~0_896) && a29 <= (v_~a29~0_896 / 5 + 11) % 29 + 3) && v_~a29~0_895 % 299978 + 300022 <= v_~a29~0_896) && 0 <= v_~a29~0_895) && 0 <= v_~a29~0_896 / 5 + 479874)) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && 0 <= a0 + 600000) && a0 + 61 <= 0) && 4 == a2)) || (((a4 + 42 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 146 <= a0) && a29 <= 599998)) || ((((2 <= a2 && a4 + 42 <= 0) && (\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 <= a0 + 600000) && a0 + 61 <= 0) [2019-12-07 17:21:47,835 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((2 <= a2 && a4 + 42 <= 0) && !(2 == a2)) && a29 <= 599998) && 43 < a29) || (((((2 <= a2 && a4 + 42 <= 0) && (a0 + 98 <= 0 || (a29 + 5 * a0 <= 599248 && 43 < a29))) && 0 < a4 + 86) && a2 <= 2) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && a0 + 98 <= 0) && 1 == a2) && 0 < a0 + 147) && a0 + 61 <= 0)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a0 + 147)) || (((a4 + 42 <= 0 && a29 <= 43) && 3 == a2) && a0 + 61 <= 0)) || (((2 <= a2 && a4 + 42 <= 0) && a29 <= 43) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (((((a4 + 42 <= 0 && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 600000)) || (((2 <= a2 && a4 + 42 <= 0) && a2 <= 2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14))) || ((((((a4 + 42 <= 0 && 1 == a2) && a29 <= 599998) && a29 + 5 * a0 <= 599248) && 0 <= a0 + 600000) && a0 + 61 <= 0) && 43 < a29)) || ((((a4 + 42 <= 0 && 1 == a2) && 0 < a0 + 147) && a29 + 6908 <= 0) && a0 + 61 <= 0)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a0~0_825 : int :: ((10 * v_~a0~0_825 < 0 && a0 + 386229 <= 5 * (v_~a0~0_825 * 10 / 4)) && v_~a0~0_825 + 61 <= 0) && !(0 == v_~a0~0_825 * 2 % 4))) && 0 <= a0 + 600000)) || (((((2 <= a2 && a4 + 42 <= 0) && !(2 == a2)) && (a0 + 98 <= 0 || (a29 + 5 * a0 <= 599248 && 43 < a29))) && a29 <= 599998) && 0 <= a0 + 600000)) || (((((2 <= a2 && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2) && a29 <= 43) && a0 + 61 <= 0)) || (((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a0 + 44) && (\exists v_~a29~0_896 : int, v_~a29~0_895 : int :: ((((43 < v_~a29~0_895 && 0 <= v_~a29~0_896) && a29 <= (v_~a29~0_896 / 5 + 11) % 29 + 3) && v_~a29~0_895 % 299978 + 300022 <= v_~a29~0_896) && 0 <= v_~a29~0_895) && 0 <= v_~a29~0_896 / 5 + 479874)) && 0 <= a29 + 127) && a0 + 44 <= 0)) || (((a4 + 42 <= 0 && 0 <= a0 + 600000) && a0 + 61 <= 0) && 4 == a2)) || (((2 <= a2 && a4 + 86 <= 0) && a29 <= 599998) && 0 < a0 + 61)) || ((((2 <= a2 && a4 + 42 <= 0) && (\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 <= a0 + 600000) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 146 <= a0) && a29 <= 599998) [2019-12-07 17:21:47,923 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2f8db1ef-c73e-4c56-9ea3-496ff91dd23e/bin/uautomizer/witness.graphml [2019-12-07 17:21:47,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:21:47,924 INFO L168 Benchmark]: Toolchain (without parser) took 183940.29 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 942.6 MB in the beginning and 1.4 GB in the end (delta: -467.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 17:21:47,925 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:21:47,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 688.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 942.6 MB in the beginning and 1.0 GB in the end (delta: -66.0 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:21:47,925 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 970.8 MB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:21:47,925 INFO L168 Benchmark]: Boogie Preprocessor took 109.31 ms. Allocated memory is still 1.1 GB. Free memory was 970.8 MB in the beginning and 949.0 MB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:21:47,925 INFO L168 Benchmark]: RCFGBuilder took 1706.66 ms. Allocated memory is still 1.1 GB. Free memory was 949.0 MB in the beginning and 883.1 MB in the end (delta: 65.9 MB). Peak memory consumption was 159.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:21:47,926 INFO L168 Benchmark]: TraceAbstraction took 181159.97 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 883.1 MB in the beginning and 1.5 GB in the end (delta: -573.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-12-07 17:21:47,926 INFO L168 Benchmark]: Witness Printer took 149.11 ms. Allocated memory is still 2.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:21:47,927 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 688.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 942.6 MB in the beginning and 1.0 GB in the end (delta: -66.0 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 120.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 970.8 MB in the end (delta: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 109.31 ms. Allocated memory is still 1.1 GB. Free memory was 970.8 MB in the beginning and 949.0 MB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1706.66 ms. Allocated memory is still 1.1 GB. Free memory was 949.0 MB in the beginning and 883.1 MB in the end (delta: 65.9 MB). Peak memory consumption was 159.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 181159.97 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 883.1 MB in the beginning and 1.5 GB in the end (delta: -573.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 149.11 ms. Allocated memory is still 2.6 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_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_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,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_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_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,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_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_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,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_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_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,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_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_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,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_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_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,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: 166]: 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-12-07 17:21:47,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((2 <= a2 && a4 + 42 <= 0) && !(2 == a2)) && a29 <= 599998) && 43 < a29) || (((((2 <= a2 && a4 + 42 <= 0) && (a0 + 98 <= 0 || (a29 + 5 * a0 <= 599248 && 43 < a29))) && 0 < a4 + 86) && a2 <= 2) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && a0 + 98 <= 0) && 1 == a2) && 0 < a0 + 147) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a0 + 147)) || (((a4 + 42 <= 0 && a29 <= 43) && 3 == a2) && a0 + 61 <= 0)) || (((2 <= a2 && a4 + 42 <= 0) && a29 <= 43) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (((((a4 + 42 <= 0 && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 600000)) || (((2 <= a2 && a4 + 42 <= 0) && a2 <= 2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14))) || ((((((a4 + 42 <= 0 && 1 == a2) && a29 <= 599998) && a29 + 5 * a0 <= 599248) && 0 <= a0 + 600000) && a0 + 61 <= 0) && 43 < a29)) || ((((a4 + 42 <= 0 && 1 == a2) && 0 < a0 + 147) && a29 + 6908 <= 0) && a0 + 61 <= 0)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a0~0_825 : int :: ((10 * v_~a0~0_825 < 0 && a0 + 386229 <= 5 * (v_~a0~0_825 * 10 / 4)) && v_~a0~0_825 + 61 <= 0) && !(0 == v_~a0~0_825 * 2 % 4))) && 0 <= a0 + 600000)) || (((((2 <= a2 && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2) && a29 <= 43) && a0 + 61 <= 0)) || (((((2 <= a2 && a4 + 42 <= 0) && !(2 == a2)) && (a0 + 98 <= 0 || (a29 + 5 * a0 <= 599248 && 43 < a29))) && a29 <= 599998) && 0 <= a0 + 600000)) || (((a4 + 86 <= 0 && 2 <= a2) && a29 <= 599998) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a0 + 44) && a0 + 44 <= 0) && (\exists v_~a29~0_896 : int, v_~a29~0_895 : int :: ((((43 < v_~a29~0_895 && 0 <= v_~a29~0_896) && a29 <= (v_~a29~0_896 / 5 + 11) % 29 + 3) && v_~a29~0_895 % 299978 + 300022 <= v_~a29~0_896) && 0 <= v_~a29~0_895) && 0 <= v_~a29~0_896 / 5 + 479874)) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && 0 <= a0 + 600000) && a0 + 61 <= 0) && 4 == a2)) || (((a4 + 42 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 146 <= a0) && a29 <= 599998)) || ((((2 <= a2 && a4 + 42 <= 0) && (\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 <= a0 + 600000) && a0 + 61 <= 0) - InvariantResult [Line: 23]: Loop Invariant [2019-12-07 17:21:47,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((2 <= a2 && a4 + 42 <= 0) && !(2 == a2)) && a29 <= 599998) && 43 < a29) || (((((2 <= a2 && a4 + 42 <= 0) && (a0 + 98 <= 0 || (a29 + 5 * a0 <= 599248 && 43 < a29))) && 0 < a4 + 86) && a2 <= 2) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && a0 + 98 <= 0) && 1 == a2) && 0 < a0 + 147) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && a29 + 144 <= 0)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a0 + 147)) || (((a4 + 42 <= 0 && a29 <= 43) && 3 == a2) && a0 + 61 <= 0)) || (((2 <= a2 && a4 + 42 <= 0) && a29 <= 43) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (((((a4 + 42 <= 0 && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 600000)) || (((2 <= a2 && a4 + 42 <= 0) && a2 <= 2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14))) || ((((((a4 + 42 <= 0 && 1 == a2) && a29 <= 599998) && a29 + 5 * a0 <= 599248) && 0 <= a0 + 600000) && a0 + 61 <= 0) && 43 < a29)) || ((((a4 + 42 <= 0 && 1 == a2) && 0 < a0 + 147) && a29 + 6908 <= 0) && a0 + 61 <= 0)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a0~0_825 : int :: ((10 * v_~a0~0_825 < 0 && a0 + 386229 <= 5 * (v_~a0~0_825 * 10 / 4)) && v_~a0~0_825 + 61 <= 0) && !(0 == v_~a0~0_825 * 2 % 4))) && 0 <= a0 + 600000)) || (((((2 <= a2 && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2) && a29 <= 43) && a0 + 61 <= 0)) || (((((2 <= a2 && a4 + 42 <= 0) && !(2 == a2)) && (a0 + 98 <= 0 || (a29 + 5 * a0 <= 599248 && 43 < a29))) && a29 <= 599998) && 0 <= a0 + 600000)) || (((a4 + 86 <= 0 && 2 <= a2) && a29 <= 599998) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a0 + 44) && a0 + 44 <= 0) && (\exists v_~a29~0_896 : int, v_~a29~0_895 : int :: ((((43 < v_~a29~0_895 && 0 <= v_~a29~0_896) && a29 <= (v_~a29~0_896 / 5 + 11) % 29 + 3) && v_~a29~0_895 % 299978 + 300022 <= v_~a29~0_896) && 0 <= v_~a29~0_895) && 0 <= v_~a29~0_896 / 5 + 479874)) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && 0 <= a0 + 600000) && a0 + 61 <= 0) && 4 == a2)) || (((a4 + 42 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 146 <= a0) && a29 <= 599998)) || ((((2 <= a2 && a4 + 42 <= 0) && (\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 <= a0 + 600000) && a0 + 61 <= 0) - InvariantResult [Line: 1658]: Loop Invariant [2019-12-07 17:21:47,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-12-07 17:21:47,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 17:21:47,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 17:21:47,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 17:21:47,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((2 <= a2 && a4 + 42 <= 0) && !(2 == a2)) && a29 <= 599998) && 43 < a29) || (((((2 <= a2 && a4 + 42 <= 0) && (a0 + 98 <= 0 || (a29 + 5 * a0 <= 599248 && 43 < a29))) && 0 < a4 + 86) && a2 <= 2) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && a0 + 98 <= 0) && 1 == a2) && 0 < a0 + 147) && a0 + 61 <= 0)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && !(2 == a2)) && 0 < a0 + 147)) || (((a4 + 42 <= 0 && a29 <= 43) && 3 == a2) && a0 + 61 <= 0)) || (((2 <= a2 && a4 + 42 <= 0) && a29 <= 43) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)))) || (((((a4 + 42 <= 0 && 0 < a4 + 86) && 1 == a2) && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 600000)) || (((2 <= a2 && a4 + 42 <= 0) && a2 <= 2) && (\exists v_prenex_1 : int :: (0 <= 9 * v_prenex_1 && 0 <= v_prenex_1 * 9 / 10) && a29 <= v_prenex_1 * 9 / 10 % 29 + 14))) || ((((((a4 + 42 <= 0 && 1 == a2) && a29 <= 599998) && a29 + 5 * a0 <= 599248) && 0 <= a0 + 600000) && a0 + 61 <= 0) && 43 < a29)) || ((((a4 + 42 <= 0 && 1 == a2) && 0 < a0 + 147) && a29 + 6908 <= 0) && a0 + 61 <= 0)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a0~0_825 : int :: ((10 * v_~a0~0_825 < 0 && a0 + 386229 <= 5 * (v_~a0~0_825 * 10 / 4)) && v_~a0~0_825 + 61 <= 0) && !(0 == v_~a0~0_825 * 2 % 4))) && 0 <= a0 + 600000)) || (((((2 <= a2 && a4 + 42 <= 0) && !(2 == a2)) && (a0 + 98 <= 0 || (a29 + 5 * a0 <= 599248 && 43 < a29))) && a29 <= 599998) && 0 <= a0 + 600000)) || (((((2 <= a2 && a4 + 42 <= 0) && 0 < a4 + 86) && a2 <= 2) && a29 <= 43) && a0 + 61 <= 0)) || (((((a4 + 89 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 0 <= a0 + 44) && (\exists v_~a29~0_896 : int, v_~a29~0_895 : int :: ((((43 < v_~a29~0_895 && 0 <= v_~a29~0_896) && a29 <= (v_~a29~0_896 / 5 + 11) % 29 + 3) && v_~a29~0_895 % 299978 + 300022 <= v_~a29~0_896) && 0 <= v_~a29~0_895) && 0 <= v_~a29~0_896 / 5 + 479874)) && 0 <= a29 + 127) && a0 + 44 <= 0)) || (((a4 + 42 <= 0 && 0 <= a0 + 600000) && a0 + 61 <= 0) && 4 == a2)) || (((2 <= a2 && a4 + 86 <= 0) && a29 <= 599998) && 0 < a0 + 61)) || ((((2 <= a2 && a4 + 42 <= 0) && (\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 <= a0 + 600000) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && ((1 == a2 && 0 <= a0 + 44) || (a4 + 86 <= 0 && 1 == a2))) && 146 <= a0) && a29 <= 599998) - 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: 152.5s, OverallIterations: 19, TraceHistogramMax: 7, AutomataDifference: 124.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 28.5s, HoareTripleCheckerStatistics: 4258 SDtfs, 22984 SDslu, 1767 SDs, 0 SdLazy, 56899 SolverSat, 6632 SolverUnsat, 28 SolverUnknown, 0 SolverNotchecked, 109.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6367 GetRequests, 6195 SyntacticMatches, 23 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20735occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 36780 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 445 NumberOfFragments, 1929 HoareAnnotationTreeSize, 4 FomulaSimplifications, 395489 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 4 FomulaSimplificationsInter, 295289 FormulaSimplificationTreeSizeReductionInter, 26.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 17992 NumberOfCodeBlocks, 17992 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 17964 ConstructedInterpolants, 1115 QuantifiedInterpolants, 70107371 SizeOfPredicates, 8 NumberOfNonLiveVariables, 7244 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 28 InterpolantComputations, 16 PerfectInterpolantSequences, 19709/22592 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...