./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem17_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem17_label21.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/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 79a2b9b3df0deda592133ad8079a83707bf29ec3 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:07:00,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:07:00,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:07:00,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:07:00,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:07:00,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:07:00,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:07:01,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:07:01,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:07:01,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:07:01,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:07:01,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:07:01,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:07:01,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:07:01,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:07:01,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:07:01,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:07:01,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:07:01,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:07:01,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:07:01,040 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:07:01,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:07:01,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:07:01,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:07:01,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:07:01,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:07:01,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:07:01,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:07:01,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:07:01,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:07:01,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:07:01,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:07:01,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:07:01,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:07:01,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:07:01,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:07:01,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:07:01,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:07:01,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:07:01,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:07:01,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:07:01,061 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:07:01,089 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:07:01,100 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:07:01,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:07:01,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:07:01,102 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:07:01,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:07:01,103 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:07:01,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:07:01,103 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:07:01,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:07:01,104 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:07:01,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:07:01,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:07:01,105 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:07:01,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:07:01,105 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:07:01,105 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:07:01,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:07:01,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:07:01,106 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:07:01,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:07:01,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:07:01,108 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:07:01,108 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:07:01,108 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:07:01,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:07:01,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:07:01,109 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:07:01,110 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_8f755dc4-a73d-467e-870f-32085bb66929/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 -> 79a2b9b3df0deda592133ad8079a83707bf29ec3 [2019-11-16 00:07:01,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:07:01,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:07:01,156 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:07:01,157 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:07:01,158 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:07:01,158 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem17_label21.c [2019-11-16 00:07:01,216 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/data/986a79c33/db4a670671e54204a5124b92df526b50/FLAGf3c1704e9 [2019-11-16 00:07:01,933 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:07:01,934 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/sv-benchmarks/c/eca-rers2012/Problem17_label21.c [2019-11-16 00:07:01,966 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/data/986a79c33/db4a670671e54204a5124b92df526b50/FLAGf3c1704e9 [2019-11-16 00:07:02,473 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/data/986a79c33/db4a670671e54204a5124b92df526b50 [2019-11-16 00:07:02,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:07:02,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:07:02,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:07:02,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:07:02,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:07:02,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:07:02" (1/1) ... [2019-11-16 00:07:02,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d47d737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:02, skipping insertion in model container [2019-11-16 00:07:02,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:07:02" (1/1) ... [2019-11-16 00:07:02,495 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:07:02,605 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:07:03,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:07:03,621 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:07:04,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:07:04,093 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:07:04,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:04 WrapperNode [2019-11-16 00:07:04,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:07:04,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:07:04,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:07:04,096 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:07:04,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:04" (1/1) ... [2019-11-16 00:07:04,170 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:04" (1/1) ... [2019-11-16 00:07:04,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:07:04,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:07:04,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:07:04,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:07:04,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:04" (1/1) ... [2019-11-16 00:07:04,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:04" (1/1) ... [2019-11-16 00:07:04,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:04" (1/1) ... [2019-11-16 00:07:04,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:04" (1/1) ... [2019-11-16 00:07:04,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:04" (1/1) ... [2019-11-16 00:07:04,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:04" (1/1) ... [2019-11-16 00:07:04,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:04" (1/1) ... [2019-11-16 00:07:04,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:07:04,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:07:04,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:07:04,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:07:04,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:07:04,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:07:04,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:07:09,880 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:07:09,881 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-16 00:07:09,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:07:09 BoogieIcfgContainer [2019-11-16 00:07:09,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:07:09,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:07:09,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:07:09,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:07:09,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:07:02" (1/3) ... [2019-11-16 00:07:09,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e4cbbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:07:09, skipping insertion in model container [2019-11-16 00:07:09,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:07:04" (2/3) ... [2019-11-16 00:07:09,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e4cbbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:07:09, skipping insertion in model container [2019-11-16 00:07:09,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:07:09" (3/3) ... [2019-11-16 00:07:09,897 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label21.c [2019-11-16 00:07:09,908 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:07:09,920 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:07:09,932 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:07:09,977 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:07:09,978 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:07:09,978 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:07:09,978 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:07:09,978 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:07:09,978 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:07:09,979 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:07:09,979 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:07:10,012 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states. [2019-11-16 00:07:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-16 00:07:10,022 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:10,023 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:10,025 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:10,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:10,032 INFO L82 PathProgramCache]: Analyzing trace with hash 118092897, now seen corresponding path program 1 times [2019-11-16 00:07:10,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:10,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630430592] [2019-11-16 00:07:10,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:10,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:10,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:10,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630430592] [2019-11-16 00:07:10,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:10,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:07:10,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422052708] [2019-11-16 00:07:10,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:10,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:10,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:10,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:10,459 INFO L87 Difference]: Start difference. First operand 590 states. Second operand 4 states. [2019-11-16 00:07:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:17,360 INFO L93 Difference]: Finished difference Result 2089 states and 3897 transitions. [2019-11-16 00:07:17,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:17,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-16 00:07:17,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:17,414 INFO L225 Difference]: With dead ends: 2089 [2019-11-16 00:07:17,415 INFO L226 Difference]: Without dead ends: 1419 [2019-11-16 00:07:17,425 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:07:17,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2019-11-16 00:07:17,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1412. [2019-11-16 00:07:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-11-16 00:07:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2069 transitions. [2019-11-16 00:07:17,586 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2069 transitions. Word has length 59 [2019-11-16 00:07:17,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:17,587 INFO L462 AbstractCegarLoop]: Abstraction has 1412 states and 2069 transitions. [2019-11-16 00:07:17,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:17,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2069 transitions. [2019-11-16 00:07:17,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-16 00:07:17,600 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:17,601 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-16 00:07:17,602 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:17,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:17,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1960864468, now seen corresponding path program 1 times [2019-11-16 00:07:17,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:17,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548793484] [2019-11-16 00:07:17,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:17,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:17,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:17,959 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:17,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548793484] [2019-11-16 00:07:17,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361571685] [2019-11-16 00:07:17,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:18,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:07:18,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:18,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:18,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:18,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:18,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:18,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:18,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:18,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:18,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:20,342 WARN L191 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 56 DAG size of output: 24 [2019-11-16 00:07:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:20,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:07:20,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-16 00:07:20,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781603824] [2019-11-16 00:07:20,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:07:20,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:20,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:07:20,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:07:20,589 INFO L87 Difference]: Start difference. First operand 1412 states and 2069 transitions. Second operand 4 states. [2019-11-16 00:07:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:36,758 INFO L93 Difference]: Finished difference Result 5459 states and 8041 transitions. [2019-11-16 00:07:36,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:07:36,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-11-16 00:07:36,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:36,783 INFO L225 Difference]: With dead ends: 5459 [2019-11-16 00:07:36,783 INFO L226 Difference]: Without dead ends: 4049 [2019-11-16 00:07:36,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:07:36,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4049 states. [2019-11-16 00:07:36,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4049 to 4007. [2019-11-16 00:07:36,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4007 states. [2019-11-16 00:07:36,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 5465 transitions. [2019-11-16 00:07:36,871 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 5465 transitions. Word has length 129 [2019-11-16 00:07:36,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:36,872 INFO L462 AbstractCegarLoop]: Abstraction has 4007 states and 5465 transitions. [2019-11-16 00:07:36,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:07:36,873 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 5465 transitions. [2019-11-16 00:07:36,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-16 00:07:36,877 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:36,877 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-16 00:07:37,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:37,083 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:37,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:37,083 INFO L82 PathProgramCache]: Analyzing trace with hash -902571425, now seen corresponding path program 1 times [2019-11-16 00:07:37,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:37,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740859416] [2019-11-16 00:07:37,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:37,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:37,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:37,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740859416] [2019-11-16 00:07:37,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:37,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:07:37,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090622969] [2019-11-16 00:07:37,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:07:37,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:37,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:07:37,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:07:37,333 INFO L87 Difference]: Start difference. First operand 4007 states and 5465 transitions. Second operand 3 states. [2019-11-16 00:07:40,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:40,248 INFO L93 Difference]: Finished difference Result 11843 states and 16152 transitions. [2019-11-16 00:07:40,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:07:40,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-11-16 00:07:40,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:40,295 INFO L225 Difference]: With dead ends: 11843 [2019-11-16 00:07:40,295 INFO L226 Difference]: Without dead ends: 6554 [2019-11-16 00:07:40,303 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:07:40,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6554 states. [2019-11-16 00:07:40,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6554 to 5273. [2019-11-16 00:07:40,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5273 states. [2019-11-16 00:07:40,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5273 states to 5273 states and 6520 transitions. [2019-11-16 00:07:40,441 INFO L78 Accepts]: Start accepts. Automaton has 5273 states and 6520 transitions. Word has length 170 [2019-11-16 00:07:40,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:40,442 INFO L462 AbstractCegarLoop]: Abstraction has 5273 states and 6520 transitions. [2019-11-16 00:07:40,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:07:40,443 INFO L276 IsEmpty]: Start isEmpty. Operand 5273 states and 6520 transitions. [2019-11-16 00:07:40,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-16 00:07:40,449 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:40,449 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:40,449 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:40,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:40,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1929248696, now seen corresponding path program 1 times [2019-11-16 00:07:40,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:40,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394286674] [2019-11-16 00:07:40,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:40,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:40,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:40,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394286674] [2019-11-16 00:07:40,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:07:40,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:07:40,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019006805] [2019-11-16 00:07:40,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:07:40,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:40,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:07:40,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:07:40,674 INFO L87 Difference]: Start difference. First operand 5273 states and 6520 transitions. Second operand 3 states. [2019-11-16 00:07:43,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:07:43,395 INFO L93 Difference]: Finished difference Result 13952 states and 17585 transitions. [2019-11-16 00:07:43,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:07:43,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-11-16 00:07:43,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:07:43,438 INFO L225 Difference]: With dead ends: 13952 [2019-11-16 00:07:43,438 INFO L226 Difference]: Without dead ends: 8681 [2019-11-16 00:07:43,445 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:07:43,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8681 states. [2019-11-16 00:07:43,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8681 to 8681. [2019-11-16 00:07:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8681 states. [2019-11-16 00:07:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8681 states to 8681 states and 10515 transitions. [2019-11-16 00:07:43,616 INFO L78 Accepts]: Start accepts. Automaton has 8681 states and 10515 transitions. Word has length 220 [2019-11-16 00:07:43,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:07:43,617 INFO L462 AbstractCegarLoop]: Abstraction has 8681 states and 10515 transitions. [2019-11-16 00:07:43,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:07:43,618 INFO L276 IsEmpty]: Start isEmpty. Operand 8681 states and 10515 transitions. [2019-11-16 00:07:43,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-11-16 00:07:43,624 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:07:43,624 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:07:43,624 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:07:43,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:07:43,625 INFO L82 PathProgramCache]: Analyzing trace with hash 843993686, now seen corresponding path program 1 times [2019-11-16 00:07:43,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:07:43,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815176703] [2019-11-16 00:07:43,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:43,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:07:43,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:07:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 379 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:07:44,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815176703] [2019-11-16 00:07:44,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115839765] [2019-11-16 00:07:44,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:07:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:07:44,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:07:44,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:07:44,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:44,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:07:44,443 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 252 proven. 70 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-16 00:07:44,443 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:07:44,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3] total 10 [2019-11-16 00:07:44,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384874025] [2019-11-16 00:07:44,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:07:44,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:07:44,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:07:44,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:07:44,447 INFO L87 Difference]: Start difference. First operand 8681 states and 10515 transitions. Second operand 11 states. [2019-11-16 00:08:04,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:04,668 INFO L93 Difference]: Finished difference Result 56929 states and 70235 transitions. [2019-11-16 00:08:04,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:08:04,669 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 283 [2019-11-16 00:08:04,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:04,763 INFO L225 Difference]: With dead ends: 56929 [2019-11-16 00:08:04,764 INFO L226 Difference]: Without dead ends: 38021 [2019-11-16 00:08:04,783 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 281 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:08:04,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38021 states. [2019-11-16 00:08:05,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38021 to 32894. [2019-11-16 00:08:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32894 states. [2019-11-16 00:08:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32894 states to 32894 states and 36573 transitions. [2019-11-16 00:08:05,427 INFO L78 Accepts]: Start accepts. Automaton has 32894 states and 36573 transitions. Word has length 283 [2019-11-16 00:08:05,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:05,427 INFO L462 AbstractCegarLoop]: Abstraction has 32894 states and 36573 transitions. [2019-11-16 00:08:05,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:08:05,428 INFO L276 IsEmpty]: Start isEmpty. Operand 32894 states and 36573 transitions. [2019-11-16 00:08:05,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-11-16 00:08:05,441 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:05,443 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:05,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:05,650 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:05,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:05,650 INFO L82 PathProgramCache]: Analyzing trace with hash -297153547, now seen corresponding path program 1 times [2019-11-16 00:08:05,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:05,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473825552] [2019-11-16 00:08:05,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:05,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:05,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:05,993 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-11-16 00:08:05,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473825552] [2019-11-16 00:08:05,994 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:05,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:08:05,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498091079] [2019-11-16 00:08:05,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:05,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:05,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:05,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:05,997 INFO L87 Difference]: Start difference. First operand 32894 states and 36573 transitions. Second operand 4 states. [2019-11-16 00:08:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:11,012 INFO L93 Difference]: Finished difference Result 85356 states and 94790 transitions. [2019-11-16 00:08:11,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:11,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 371 [2019-11-16 00:08:11,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:11,162 INFO L225 Difference]: With dead ends: 85356 [2019-11-16 00:08:11,162 INFO L226 Difference]: Without dead ends: 52029 [2019-11-16 00:08:11,202 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52029 states. [2019-11-16 00:08:11,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52029 to 45208. [2019-11-16 00:08:11,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45208 states. [2019-11-16 00:08:11,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45208 states to 45208 states and 49093 transitions. [2019-11-16 00:08:11,881 INFO L78 Accepts]: Start accepts. Automaton has 45208 states and 49093 transitions. Word has length 371 [2019-11-16 00:08:11,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:11,882 INFO L462 AbstractCegarLoop]: Abstraction has 45208 states and 49093 transitions. [2019-11-16 00:08:11,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand 45208 states and 49093 transitions. [2019-11-16 00:08:11,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2019-11-16 00:08:11,918 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:11,919 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:11,919 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:11,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:11,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1172474053, now seen corresponding path program 1 times [2019-11-16 00:08:11,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:11,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444239851] [2019-11-16 00:08:11,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:11,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:11,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-16 00:08:12,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444239851] [2019-11-16 00:08:12,510 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:12,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:08:12,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455637083] [2019-11-16 00:08:12,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:08:12,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:12,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:08:12,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:12,513 INFO L87 Difference]: Start difference. First operand 45208 states and 49093 transitions. Second operand 3 states. [2019-11-16 00:08:15,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:15,099 INFO L93 Difference]: Finished difference Result 89987 states and 97755 transitions. [2019-11-16 00:08:15,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:08:15,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 544 [2019-11-16 00:08:15,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:15,157 INFO L225 Difference]: With dead ends: 89987 [2019-11-16 00:08:15,157 INFO L226 Difference]: Without dead ends: 45205 [2019-11-16 00:08:15,182 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:15,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45205 states. [2019-11-16 00:08:15,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45205 to 45205. [2019-11-16 00:08:15,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45205 states. [2019-11-16 00:08:15,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45205 states to 45205 states and 49082 transitions. [2019-11-16 00:08:15,746 INFO L78 Accepts]: Start accepts. Automaton has 45205 states and 49082 transitions. Word has length 544 [2019-11-16 00:08:15,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:15,748 INFO L462 AbstractCegarLoop]: Abstraction has 45205 states and 49082 transitions. [2019-11-16 00:08:15,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:08:15,748 INFO L276 IsEmpty]: Start isEmpty. Operand 45205 states and 49082 transitions. [2019-11-16 00:08:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2019-11-16 00:08:15,801 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:15,802 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:15,802 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:15,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:15,803 INFO L82 PathProgramCache]: Analyzing trace with hash -596677162, now seen corresponding path program 1 times [2019-11-16 00:08:15,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:15,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004287289] [2019-11-16 00:08:15,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:15,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:15,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-11-16 00:08:16,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004287289] [2019-11-16 00:08:16,271 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:16,271 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:08:16,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365955783] [2019-11-16 00:08:16,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:08:16,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:16,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:08:16,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:16,274 INFO L87 Difference]: Start difference. First operand 45205 states and 49082 transitions. Second operand 3 states. [2019-11-16 00:08:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:18,994 INFO L93 Difference]: Finished difference Result 92538 states and 100453 transitions. [2019-11-16 00:08:18,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:08:18,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 645 [2019-11-16 00:08:18,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:19,051 INFO L225 Difference]: With dead ends: 92538 [2019-11-16 00:08:19,051 INFO L226 Difference]: Without dead ends: 47760 [2019-11-16 00:08:19,076 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:19,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47760 states. [2019-11-16 00:08:19,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47760 to 46481. [2019-11-16 00:08:19,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46481 states. [2019-11-16 00:08:19,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46481 states to 46481 states and 50065 transitions. [2019-11-16 00:08:19,664 INFO L78 Accepts]: Start accepts. Automaton has 46481 states and 50065 transitions. Word has length 645 [2019-11-16 00:08:19,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:19,665 INFO L462 AbstractCegarLoop]: Abstraction has 46481 states and 50065 transitions. [2019-11-16 00:08:19,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:08:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand 46481 states and 50065 transitions. [2019-11-16 00:08:19,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2019-11-16 00:08:19,715 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:19,716 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 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] [2019-11-16 00:08:19,716 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:19,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:19,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1894460424, now seen corresponding path program 1 times [2019-11-16 00:08:19,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:19,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148934487] [2019-11-16 00:08:19,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:19,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:19,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1298 backedges. 972 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2019-11-16 00:08:20,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148934487] [2019-11-16 00:08:20,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:20,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:08:20,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016280015] [2019-11-16 00:08:20,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:08:20,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:20,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:08:20,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:20,347 INFO L87 Difference]: Start difference. First operand 46481 states and 50065 transitions. Second operand 3 states. [2019-11-16 00:08:24,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:24,239 INFO L93 Difference]: Finished difference Result 95941 states and 103493 transitions. [2019-11-16 00:08:24,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:08:24,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 653 [2019-11-16 00:08:24,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:24,295 INFO L225 Difference]: With dead ends: 95941 [2019-11-16 00:08:24,295 INFO L226 Difference]: Without dead ends: 49887 [2019-11-16 00:08:24,314 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:24,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49887 states. [2019-11-16 00:08:24,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49887 to 49028. [2019-11-16 00:08:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49028 states. [2019-11-16 00:08:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49028 states to 49028 states and 52601 transitions. [2019-11-16 00:08:24,842 INFO L78 Accepts]: Start accepts. Automaton has 49028 states and 52601 transitions. Word has length 653 [2019-11-16 00:08:24,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:24,844 INFO L462 AbstractCegarLoop]: Abstraction has 49028 states and 52601 transitions. [2019-11-16 00:08:24,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:08:24,844 INFO L276 IsEmpty]: Start isEmpty. Operand 49028 states and 52601 transitions. [2019-11-16 00:08:24,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2019-11-16 00:08:24,871 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:24,872 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:24,872 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:24,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:24,873 INFO L82 PathProgramCache]: Analyzing trace with hash -663517467, now seen corresponding path program 1 times [2019-11-16 00:08:24,873 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:24,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035525411] [2019-11-16 00:08:24,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:24,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:24,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:25,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2019-11-16 00:08:25,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035525411] [2019-11-16 00:08:25,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:25,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:08:25,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874023665] [2019-11-16 00:08:25,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:08:25,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:25,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:08:25,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:25,364 INFO L87 Difference]: Start difference. First operand 49028 states and 52601 transitions. Second operand 3 states. [2019-11-16 00:08:28,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:28,372 INFO L93 Difference]: Finished difference Result 111675 states and 119830 transitions. [2019-11-16 00:08:28,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:08:28,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 679 [2019-11-16 00:08:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:28,430 INFO L225 Difference]: With dead ends: 111675 [2019-11-16 00:08:28,430 INFO L226 Difference]: Without dead ends: 63074 [2019-11-16 00:08:28,452 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:28,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63074 states. [2019-11-16 00:08:29,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63074 to 58381. [2019-11-16 00:08:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58381 states. [2019-11-16 00:08:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58381 states to 58381 states and 62711 transitions. [2019-11-16 00:08:29,176 INFO L78 Accepts]: Start accepts. Automaton has 58381 states and 62711 transitions. Word has length 679 [2019-11-16 00:08:29,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:29,178 INFO L462 AbstractCegarLoop]: Abstraction has 58381 states and 62711 transitions. [2019-11-16 00:08:29,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:08:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand 58381 states and 62711 transitions. [2019-11-16 00:08:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2019-11-16 00:08:29,208 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:29,208 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:29,209 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:29,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:29,209 INFO L82 PathProgramCache]: Analyzing trace with hash -921532675, now seen corresponding path program 1 times [2019-11-16 00:08:29,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:29,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290465990] [2019-11-16 00:08:29,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:29,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:29,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1388 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-11-16 00:08:30,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290465990] [2019-11-16 00:08:30,091 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:30,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:08:30,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073664067] [2019-11-16 00:08:30,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:08:30,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:30,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:08:30,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:30,093 INFO L87 Difference]: Start difference. First operand 58381 states and 62711 transitions. Second operand 3 states. [2019-11-16 00:08:32,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:32,291 INFO L93 Difference]: Finished difference Result 116764 states and 125442 transitions. [2019-11-16 00:08:32,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:08:32,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 721 [2019-11-16 00:08:32,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:32,347 INFO L225 Difference]: With dead ends: 116764 [2019-11-16 00:08:32,347 INFO L226 Difference]: Without dead ends: 58810 [2019-11-16 00:08:32,371 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:08:32,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58810 states. [2019-11-16 00:08:32,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58810 to 57530. [2019-11-16 00:08:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57530 states. [2019-11-16 00:08:32,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57530 states to 57530 states and 61715 transitions. [2019-11-16 00:08:32,925 INFO L78 Accepts]: Start accepts. Automaton has 57530 states and 61715 transitions. Word has length 721 [2019-11-16 00:08:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:32,926 INFO L462 AbstractCegarLoop]: Abstraction has 57530 states and 61715 transitions. [2019-11-16 00:08:32,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:08:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 57530 states and 61715 transitions. [2019-11-16 00:08:32,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2019-11-16 00:08:32,961 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:32,961 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:32,962 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:32,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:32,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1712345726, now seen corresponding path program 1 times [2019-11-16 00:08:32,963 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:32,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330370154] [2019-11-16 00:08:32,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:32,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:32,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:35,361 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 61 proven. 525 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-11-16 00:08:35,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330370154] [2019-11-16 00:08:35,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807809213] [2019-11-16 00:08:35,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:35,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:08:35,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:35,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-16 00:08:35,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-16 00:08:35,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:35,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:35,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:35,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:35,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:35,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 457 proven. 286 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-16 00:08:36,825 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:36,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2019-11-16 00:08:36,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110182451] [2019-11-16 00:08:36,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:08:36,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:36,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:08:36,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:08:36,827 INFO L87 Difference]: Start difference. First operand 57530 states and 61715 transitions. Second operand 10 states. [2019-11-16 00:08:45,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:45,322 INFO L93 Difference]: Finished difference Result 123050 states and 131340 transitions. [2019-11-16 00:08:45,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:08:45,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 815 [2019-11-16 00:08:45,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:45,398 INFO L225 Difference]: With dead ends: 123050 [2019-11-16 00:08:45,398 INFO L226 Difference]: Without dead ends: 65518 [2019-11-16 00:08:45,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 849 GetRequests, 824 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:08:45,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65518 states. [2019-11-16 00:08:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65518 to 56656. [2019-11-16 00:08:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56656 states. [2019-11-16 00:08:45,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56656 states to 56656 states and 59593 transitions. [2019-11-16 00:08:45,989 INFO L78 Accepts]: Start accepts. Automaton has 56656 states and 59593 transitions. Word has length 815 [2019-11-16 00:08:46,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:46,266 INFO L462 AbstractCegarLoop]: Abstraction has 56656 states and 59593 transitions. [2019-11-16 00:08:46,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:08:46,266 INFO L276 IsEmpty]: Start isEmpty. Operand 56656 states and 59593 transitions. [2019-11-16 00:08:46,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 835 [2019-11-16 00:08:46,307 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:46,308 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:08:46,516 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:46,516 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:46,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:46,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1434265694, now seen corresponding path program 1 times [2019-11-16 00:08:46,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:46,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075422314] [2019-11-16 00:08:46,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:46,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:46,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 732 proven. 291 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-11-16 00:08:48,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075422314] [2019-11-16 00:08:48,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614066890] [2019-11-16 00:08:48,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:48,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:08:48,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 1023 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-11-16 00:08:49,517 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:08:49,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-11-16 00:08:49,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167381045] [2019-11-16 00:08:49,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:49,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:49,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:49,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:08:49,520 INFO L87 Difference]: Start difference. First operand 56656 states and 59593 transitions. Second operand 4 states. [2019-11-16 00:08:53,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:53,330 INFO L93 Difference]: Finished difference Result 135020 states and 142236 transitions. [2019-11-16 00:08:53,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:53,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 834 [2019-11-16 00:08:53,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:53,396 INFO L225 Difference]: With dead ends: 135020 [2019-11-16 00:08:53,397 INFO L226 Difference]: Without dead ends: 78366 [2019-11-16 00:08:53,420 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 833 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:08:53,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78366 states. [2019-11-16 00:08:54,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78366 to 69857. [2019-11-16 00:08:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69857 states. [2019-11-16 00:08:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69857 states to 69857 states and 73423 transitions. [2019-11-16 00:08:54,096 INFO L78 Accepts]: Start accepts. Automaton has 69857 states and 73423 transitions. Word has length 834 [2019-11-16 00:08:54,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:54,096 INFO L462 AbstractCegarLoop]: Abstraction has 69857 states and 73423 transitions. [2019-11-16 00:08:54,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand 69857 states and 73423 transitions. [2019-11-16 00:08:54,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2019-11-16 00:08:54,128 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:54,128 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:08:54,329 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:54,329 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:08:54,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:54,330 INFO L82 PathProgramCache]: Analyzing trace with hash 828435157, now seen corresponding path program 1 times [2019-11-16 00:08:54,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:54,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546578000] [2019-11-16 00:08:54,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:54,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:54,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1362 backedges. 389 proven. 973 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:56,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546578000] [2019-11-16 00:08:56,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302983612] [2019-11-16 00:08:56,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:56,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:08:56,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:56,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:56,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:08:59,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1362 backedges. 1093 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-11-16 00:08:59,094 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:08:59,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2019-11-16 00:08:59,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700155339] [2019-11-16 00:08:59,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:08:59,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:59,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:08:59,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:08:59,097 INFO L87 Difference]: Start difference. First operand 69857 states and 73423 transitions. Second operand 5 states. [2019-11-16 00:09:09,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:09,714 INFO L93 Difference]: Finished difference Result 149505 states and 157010 transitions. [2019-11-16 00:09:09,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:09:09,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 871 [2019-11-16 00:09:09,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:09,794 INFO L225 Difference]: With dead ends: 149505 [2019-11-16 00:09:09,794 INFO L226 Difference]: Without dead ends: 80075 [2019-11-16 00:09:09,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 883 GetRequests, 869 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:09:09,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80075 states. [2019-11-16 00:09:10,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80075 to 72409. [2019-11-16 00:09:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72409 states. [2019-11-16 00:09:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72409 states to 72409 states and 76063 transitions. [2019-11-16 00:09:10,460 INFO L78 Accepts]: Start accepts. Automaton has 72409 states and 76063 transitions. Word has length 871 [2019-11-16 00:09:10,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:10,461 INFO L462 AbstractCegarLoop]: Abstraction has 72409 states and 76063 transitions. [2019-11-16 00:09:10,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:09:10,461 INFO L276 IsEmpty]: Start isEmpty. Operand 72409 states and 76063 transitions. [2019-11-16 00:09:10,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2019-11-16 00:09:10,490 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:10,490 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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] [2019-11-16 00:09:10,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:10,694 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:10,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:10,694 INFO L82 PathProgramCache]: Analyzing trace with hash 608232330, now seen corresponding path program 1 times [2019-11-16 00:09:10,694 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:10,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758373818] [2019-11-16 00:09:10,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:10,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:10,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 1087 proven. 125 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-11-16 00:09:11,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758373818] [2019-11-16 00:09:11,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418197674] [2019-11-16 00:09:11,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:11,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:09:11,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 1203 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2019-11-16 00:09:13,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:09:13,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2019-11-16 00:09:13,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965396924] [2019-11-16 00:09:13,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:09:13,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:13,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:09:13,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:09:13,495 INFO L87 Difference]: Start difference. First operand 72409 states and 76063 transitions. Second operand 5 states. [2019-11-16 00:09:39,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:39,518 INFO L93 Difference]: Finished difference Result 168658 states and 177412 transitions. [2019-11-16 00:09:39,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:09:39,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 926 [2019-11-16 00:09:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:39,600 INFO L225 Difference]: With dead ends: 168658 [2019-11-16 00:09:39,600 INFO L226 Difference]: Without dead ends: 95826 [2019-11-16 00:09:39,629 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 935 GetRequests, 924 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:09:39,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95826 states. [2019-11-16 00:09:40,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95826 to 74962. [2019-11-16 00:09:40,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74962 states. [2019-11-16 00:09:40,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74962 states to 74962 states and 78499 transitions. [2019-11-16 00:09:40,366 INFO L78 Accepts]: Start accepts. Automaton has 74962 states and 78499 transitions. Word has length 926 [2019-11-16 00:09:40,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:40,366 INFO L462 AbstractCegarLoop]: Abstraction has 74962 states and 78499 transitions. [2019-11-16 00:09:40,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:09:40,367 INFO L276 IsEmpty]: Start isEmpty. Operand 74962 states and 78499 transitions. [2019-11-16 00:09:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 972 [2019-11-16 00:09:40,398 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:40,399 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:09:40,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:40,602 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:09:40,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:40,602 INFO L82 PathProgramCache]: Analyzing trace with hash 356088525, now seen corresponding path program 1 times [2019-11-16 00:09:40,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:40,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584124527] [2019-11-16 00:09:40,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:40,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:40,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:41,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1917 backedges. 1233 proven. 285 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2019-11-16 00:09:41,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584124527] [2019-11-16 00:09:41,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821571016] [2019-11-16 00:09:41,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:41,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 1167 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:09:41,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:41,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-16 00:09:41,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:09:41,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:09:41,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:09:41,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:09:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1917 backedges. 969 proven. 293 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2019-11-16 00:09:43,121 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:43,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-11-16 00:09:43,122 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406511566] [2019-11-16 00:09:43,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:09:43,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:43,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:09:43,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:09:43,123 INFO L87 Difference]: Start difference. First operand 74962 states and 78499 transitions. Second operand 11 states. [2019-11-16 00:10:03,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:03,549 INFO L93 Difference]: Finished difference Result 203305 states and 213222 transitions. [2019-11-16 00:10:03,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-16 00:10:03,550 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 971 [2019-11-16 00:10:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:03,666 INFO L225 Difference]: With dead ends: 203305 [2019-11-16 00:10:03,666 INFO L226 Difference]: Without dead ends: 127917 [2019-11-16 00:10:03,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1053 GetRequests, 1005 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=559, Invalid=1793, Unknown=0, NotChecked=0, Total=2352 [2019-11-16 00:10:03,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127917 states. [2019-11-16 00:10:04,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127917 to 91137. [2019-11-16 00:10:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91137 states. [2019-11-16 00:10:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91137 states to 91137 states and 95143 transitions. [2019-11-16 00:10:04,674 INFO L78 Accepts]: Start accepts. Automaton has 91137 states and 95143 transitions. Word has length 971 [2019-11-16 00:10:04,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:04,674 INFO L462 AbstractCegarLoop]: Abstraction has 91137 states and 95143 transitions. [2019-11-16 00:10:04,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:10:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 91137 states and 95143 transitions. [2019-11-16 00:10:04,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1266 [2019-11-16 00:10:04,728 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:04,729 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:10:04,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:10:04,930 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:10:04,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:04,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1234157656, now seen corresponding path program 1 times [2019-11-16 00:10:04,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:04,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924049079] [2019-11-16 00:10:04,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:04,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:04,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 873 proven. 1301 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-16 00:10:07,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924049079] [2019-11-16 00:10:07,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68125230] [2019-11-16 00:10:07,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:10:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:07,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 1477 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:10:07,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 803 proven. 82 refuted. 0 times theorem prover too weak. 1371 trivial. 0 not checked. [2019-11-16 00:10:08,344 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:10:08,345 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2019-11-16 00:10:08,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740753165] [2019-11-16 00:10:08,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:10:08,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:08,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:10:08,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:10:08,347 INFO L87 Difference]: Start difference. First operand 91137 states and 95143 transitions. Second operand 11 states. [2019-11-16 00:10:25,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:25,348 INFO L93 Difference]: Finished difference Result 220626 states and 230153 transitions. [2019-11-16 00:10:25,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-16 00:10:25,348 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1265 [2019-11-16 00:10:25,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:25,460 INFO L225 Difference]: With dead ends: 220626 [2019-11-16 00:10:25,460 INFO L226 Difference]: Without dead ends: 129916 [2019-11-16 00:10:25,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1309 GetRequests, 1282 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=257, Invalid=555, Unknown=0, NotChecked=0, Total=812 [2019-11-16 00:10:25,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129916 states. [2019-11-16 00:10:26,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129916 to 104758. [2019-11-16 00:10:26,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104758 states. [2019-11-16 00:10:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104758 states to 104758 states and 109431 transitions. [2019-11-16 00:10:26,609 INFO L78 Accepts]: Start accepts. Automaton has 104758 states and 109431 transitions. Word has length 1265 [2019-11-16 00:10:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:26,609 INFO L462 AbstractCegarLoop]: Abstraction has 104758 states and 109431 transitions. [2019-11-16 00:10:26,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:10:26,609 INFO L276 IsEmpty]: Start isEmpty. Operand 104758 states and 109431 transitions. [2019-11-16 00:10:26,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1360 [2019-11-16 00:10:26,669 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:26,669 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:10:26,870 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:10:26,870 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:10:26,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:26,871 INFO L82 PathProgramCache]: Analyzing trace with hash 494248151, now seen corresponding path program 1 times [2019-11-16 00:10:26,871 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:26,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856285455] [2019-11-16 00:10:26,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:26,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:26,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2807 backedges. 1212 proven. 1366 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-11-16 00:10:31,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856285455] [2019-11-16 00:10:31,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004052073] [2019-11-16 00:10:31,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:10:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:31,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 1596 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:10:31,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:31,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:31,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:31,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:31,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:31,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:31,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:31,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:32,736 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_5 Int)) (let ((.cse1 (* v_prenex_5 9))) (let ((.cse0 (mod (+ (div .cse1 10) 1) 299849))) (and (<= c_~a28~0 (+ .cse0 300149)) (not (= 0 (mod .cse1 10))) (< (* 9 v_prenex_5) 0) (= 0 .cse0))))) (exists ((v_~a28~0_1304 Int)) (let ((.cse2 (* v_~a28~0_1304 9))) (let ((.cse3 (div .cse2 10))) (and (= 0 (mod .cse2 10)) (<= c_~a28~0 (+ (mod .cse3 299849) 300149)) (<= 0 .cse3))))) (exists ((v_~a28~0_1304 Int)) (let ((.cse5 (* v_~a28~0_1304 9))) (let ((.cse6 (div .cse5 10))) (let ((.cse4 (mod .cse6 299849))) (and (not (= 0 .cse4)) (= 0 (mod .cse5 10)) (< .cse6 0) (<= c_~a28~0 (+ .cse4 300))))))) (exists ((v_~a28~0_1304 Int)) (let ((.cse7 (div (* v_~a28~0_1304 9) 10))) (and (<= c_~a28~0 (+ (mod .cse7 299849) 300149)) (<= 0 (* 9 v_~a28~0_1304)) (<= 0 .cse7)))) (exists ((v_~a28~0_1304 Int)) (let ((.cse8 (* v_~a28~0_1304 9))) (let ((.cse9 (mod (div .cse8 10) 299849))) (and (= 0 (mod .cse8 10)) (<= c_~a28~0 (+ .cse9 300149)) (= 0 .cse9))))) (exists ((v_~a28~0_1304 Int)) (let ((.cse10 (mod (div (* v_~a28~0_1304 9) 10) 299849))) (and (<= c_~a28~0 (+ .cse10 300149)) (<= 0 (* 9 v_~a28~0_1304)) (= 0 .cse10)))) (exists ((v_prenex_5 Int)) (let ((.cse12 (* v_prenex_5 9))) (let ((.cse11 (+ (div .cse12 10) 1))) (and (<= 0 .cse11) (<= c_~a28~0 (+ (mod .cse11 299849) 300149)) (not (= 0 (mod .cse12 10))) (< (* 9 v_prenex_5) 0))))) (exists ((v_prenex_5 Int)) (let ((.cse15 (* v_prenex_5 9))) (let ((.cse14 (+ (div .cse15 10) 1))) (let ((.cse13 (mod .cse14 299849))) (and (<= c_~a28~0 (+ .cse13 300)) (not (= 0 .cse13)) (< .cse14 0) (not (= 0 (mod .cse15 10))) (< (* 9 v_prenex_5) 0)))))) (exists ((v_~a28~0_1304 Int)) (let ((.cse17 (div (* v_~a28~0_1304 9) 10))) (let ((.cse16 (mod .cse17 299849))) (and (not (= 0 .cse16)) (< .cse17 0) (<= 0 (* 9 v_~a28~0_1304)) (<= c_~a28~0 (+ .cse16 300))))))) is different from true [2019-11-16 00:10:34,115 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_5 Int)) (let ((.cse1 (* v_prenex_5 9))) (let ((.cse0 (mod (+ (div .cse1 10) 1) 299849))) (and (<= c_~a28~0 (+ .cse0 300149)) (not (= 0 (mod .cse1 10))) (< (* 9 v_prenex_5) 0) (= 0 .cse0))))) (exists ((v_prenex_7 Int)) (let ((.cse2 (div (* v_prenex_7 9) 10))) (and (<= 0 (* 9 v_prenex_7)) (<= c_~a28~0 (+ (mod .cse2 299849) 300149)) (<= 0 .cse2)))) (exists ((v_prenex_9 Int)) (let ((.cse3 (mod (div (* v_prenex_9 9) 10) 299849))) (and (<= 0 (* 9 v_prenex_9)) (<= c_~a28~0 (+ .cse3 300149)) (= 0 .cse3)))) (exists ((v_prenex_8 Int)) (let ((.cse5 (* v_prenex_8 9))) (let ((.cse4 (mod (div .cse5 10) 299849))) (and (= 0 .cse4) (= 0 (mod .cse5 10)) (<= c_~a28~0 (+ .cse4 300149)))))) (exists ((v_~a28~0_1304 Int)) (let ((.cse6 (* v_~a28~0_1304 9))) (let ((.cse7 (div .cse6 10))) (and (= 0 (mod .cse6 10)) (<= c_~a28~0 (+ (mod .cse7 299849) 300149)) (<= 0 .cse7))))) (exists ((v_prenex_6 Int)) (let ((.cse10 (* v_prenex_6 9))) (let ((.cse8 (div .cse10 10))) (let ((.cse9 (mod .cse8 299849))) (and (< .cse8 0) (not (= 0 .cse9)) (= 0 (mod .cse10 10)) (<= c_~a28~0 (+ .cse9 300))))))) (exists ((v_prenex_11 Int)) (let ((.cse12 (* v_prenex_11 9))) (let ((.cse13 (+ (div .cse12 10) 1))) (let ((.cse11 (mod .cse13 299849))) (and (not (= 0 .cse11)) (not (= 0 (mod .cse12 10))) (<= c_~a28~0 (+ .cse11 300)) (< (* 9 v_prenex_11) 0) (< .cse13 0)))))) (exists ((v_prenex_10 Int)) (let ((.cse14 (* v_prenex_10 9))) (let ((.cse15 (+ (div .cse14 10) 1))) (and (< (* 9 v_prenex_10) 0) (not (= 0 (mod .cse14 10))) (<= c_~a28~0 (+ (mod .cse15 299849) 300149)) (<= 0 .cse15))))) (exists ((v_prenex_12 Int)) (let ((.cse16 (div (* v_prenex_12 9) 10))) (let ((.cse17 (mod .cse16 299849))) (and (< .cse16 0) (not (= 0 .cse17)) (<= 0 (* 9 v_prenex_12)) (<= c_~a28~0 (+ .cse17 300))))))) is different from true [2019-11-16 00:10:35,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-11-16 00:10:37,779 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 119 DAG size of output: 17 [2019-11-16 00:10:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2807 backedges. 1319 proven. 0 refuted. 0 times theorem prover too weak. 1430 trivial. 58 not checked. [2019-11-16 00:10:57,918 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:10:57,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-11-16 00:10:57,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751410565] [2019-11-16 00:10:57,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-16 00:10:57,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:57,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-16 00:10:57,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=83, Unknown=3, NotChecked=38, Total=156 [2019-11-16 00:10:57,921 INFO L87 Difference]: Start difference. First operand 104758 states and 109431 transitions. Second operand 13 states. [2019-11-16 00:11:19,156 WARN L191 SmtUtils]: Spent 538.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-16 00:11:25,856 WARN L191 SmtUtils]: Spent 4.61 s on a formula simplification. DAG size of input: 78 DAG size of output: 31 [2019-11-16 00:11:34,630 WARN L191 SmtUtils]: Spent 6.91 s on a formula simplification. DAG size of input: 83 DAG size of output: 37 [2019-11-16 00:11:56,237 WARN L191 SmtUtils]: Spent 8.15 s on a formula simplification. DAG size of input: 77 DAG size of output: 33 [2019-11-16 00:16:00,793 WARN L191 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-11-16 00:16:18,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:18,701 INFO L93 Difference]: Finished difference Result 301008 states and 313837 transitions. [2019-11-16 00:16:18,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-16 00:16:18,702 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1359 [2019-11-16 00:16:18,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:18,867 INFO L225 Difference]: With dead ends: 301008 [2019-11-16 00:16:18,867 INFO L226 Difference]: Without dead ends: 195402 [2019-11-16 00:16:18,919 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1437 GetRequests, 1386 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 794 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=540, Invalid=1427, Unknown=21, NotChecked=174, Total=2162 [2019-11-16 00:16:19,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195402 states. [2019-11-16 00:16:20,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195402 to 125079. [2019-11-16 00:16:20,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125079 states. [2019-11-16 00:16:20,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125079 states to 125079 states and 130589 transitions. [2019-11-16 00:16:20,681 INFO L78 Accepts]: Start accepts. Automaton has 125079 states and 130589 transitions. Word has length 1359 [2019-11-16 00:16:20,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:20,682 INFO L462 AbstractCegarLoop]: Abstraction has 125079 states and 130589 transitions. [2019-11-16 00:16:20,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-16 00:16:20,682 INFO L276 IsEmpty]: Start isEmpty. Operand 125079 states and 130589 transitions. [2019-11-16 00:16:20,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1418 [2019-11-16 00:16:20,746 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:20,747 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:16:20,948 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:16:20,949 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:16:20,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:20,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1687811672, now seen corresponding path program 1 times [2019-11-16 00:16:20,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:20,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110010849] [2019-11-16 00:16:20,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:20,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:20,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:22,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3002 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 2603 trivial. 0 not checked. [2019-11-16 00:16:22,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110010849] [2019-11-16 00:16:22,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:16:22,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:16:22,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652872612] [2019-11-16 00:16:22,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:16:22,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:22,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:16:22,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:16:22,497 INFO L87 Difference]: Start difference. First operand 125079 states and 130589 transitions. Second operand 3 states. [2019-11-16 00:16:24,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:24,628 INFO L93 Difference]: Finished difference Result 236094 states and 246509 transitions. [2019-11-16 00:16:24,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:16:24,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1417 [2019-11-16 00:16:24,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:24,726 INFO L225 Difference]: With dead ends: 236094 [2019-11-16 00:16:24,726 INFO L226 Difference]: Without dead ends: 111439 [2019-11-16 00:16:24,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:16:24,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111439 states. [2019-11-16 00:16:25,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111439 to 105043. [2019-11-16 00:16:25,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105043 states. [2019-11-16 00:16:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105043 states to 105043 states and 109642 transitions. [2019-11-16 00:16:25,726 INFO L78 Accepts]: Start accepts. Automaton has 105043 states and 109642 transitions. Word has length 1417 [2019-11-16 00:16:25,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:25,727 INFO L462 AbstractCegarLoop]: Abstraction has 105043 states and 109642 transitions. [2019-11-16 00:16:25,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:16:25,727 INFO L276 IsEmpty]: Start isEmpty. Operand 105043 states and 109642 transitions. [2019-11-16 00:16:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1476 [2019-11-16 00:16:25,785 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:25,786 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:16:25,786 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:16:25,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:25,787 INFO L82 PathProgramCache]: Analyzing trace with hash 934453682, now seen corresponding path program 1 times [2019-11-16 00:16:25,787 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:25,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979630356] [2019-11-16 00:16:25,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:25,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:25,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3798 backedges. 1547 proven. 0 refuted. 0 times theorem prover too weak. 2251 trivial. 0 not checked. [2019-11-16 00:16:27,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979630356] [2019-11-16 00:16:27,858 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:16:27,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:16:27,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987918248] [2019-11-16 00:16:27,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:16:27,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:27,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:16:27,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:16:27,860 INFO L87 Difference]: Start difference. First operand 105043 states and 109642 transitions. Second operand 5 states. [2019-11-16 00:16:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:31,599 INFO L93 Difference]: Finished difference Result 218622 states and 227995 transitions. [2019-11-16 00:16:31,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:16:31,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1475 [2019-11-16 00:16:31,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:31,695 INFO L225 Difference]: With dead ends: 218622 [2019-11-16 00:16:31,695 INFO L226 Difference]: Without dead ends: 113580 [2019-11-16 00:16:31,734 INFO L600 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-11-16 00:16:31,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113580 states. [2019-11-16 00:16:32,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113580 to 103768. [2019-11-16 00:16:32,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103768 states. [2019-11-16 00:16:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103768 states to 103768 states and 108257 transitions. [2019-11-16 00:16:32,739 INFO L78 Accepts]: Start accepts. Automaton has 103768 states and 108257 transitions. Word has length 1475 [2019-11-16 00:16:32,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:32,740 INFO L462 AbstractCegarLoop]: Abstraction has 103768 states and 108257 transitions. [2019-11-16 00:16:32,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:16:32,741 INFO L276 IsEmpty]: Start isEmpty. Operand 103768 states and 108257 transitions. [2019-11-16 00:16:32,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1786 [2019-11-16 00:16:32,834 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:16:32,835 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:16:32,835 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:16:32,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:16:32,836 INFO L82 PathProgramCache]: Analyzing trace with hash -244581159, now seen corresponding path program 1 times [2019-11-16 00:16:32,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:16:32,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217182944] [2019-11-16 00:16:32,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:32,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:16:32,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:16:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:16:35,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4357 backedges. 2409 proven. 0 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2019-11-16 00:16:35,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217182944] [2019-11-16 00:16:35,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:16:35,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:16:35,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514759361] [2019-11-16 00:16:35,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:16:35,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:16:35,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:16:35,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:16:35,659 INFO L87 Difference]: Start difference. First operand 103768 states and 108257 transitions. Second operand 5 states. [2019-11-16 00:16:39,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:16:39,915 INFO L93 Difference]: Finished difference Result 223312 states and 232659 transitions. [2019-11-16 00:16:39,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:16:39,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1785 [2019-11-16 00:16:39,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:16:39,917 INFO L225 Difference]: With dead ends: 223312 [2019-11-16 00:16:39,917 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:16:39,955 INFO L600 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-11-16 00:16:39,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:16:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:16:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:16:39,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:16:39,956 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1785 [2019-11-16 00:16:39,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:16:39,956 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:16:39,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:16:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:16:39,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:16:39,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:16:49,473 WARN L191 SmtUtils]: Spent 9.50 s on a formula simplification. DAG size of input: 2272 DAG size of output: 1832 [2019-11-16 00:16:57,073 WARN L191 SmtUtils]: Spent 7.59 s on a formula simplification. DAG size of input: 1961 DAG size of output: 1613 [2019-11-16 00:17:05,980 WARN L191 SmtUtils]: Spent 8.90 s on a formula simplification. DAG size of input: 2269 DAG size of output: 1831 [2019-11-16 00:17:48,261 WARN L191 SmtUtils]: Spent 42.27 s on a formula simplification. DAG size of input: 1706 DAG size of output: 149 [2019-11-16 00:18:28,693 WARN L191 SmtUtils]: Spent 40.42 s on a formula simplification. DAG size of input: 1527 DAG size of output: 162 [2019-11-16 00:19:13,727 WARN L191 SmtUtils]: Spent 45.03 s on a formula simplification. DAG size of input: 1706 DAG size of output: 149 [2019-11-16 00:19:13,729 INFO L443 ceAbstractionStarter]: For program point L1819(lines 1819 1830) no Hoare annotation was computed. [2019-11-16 00:19:13,729 INFO L443 ceAbstractionStarter]: For program point L762(lines 762 770) no Hoare annotation was computed. [2019-11-16 00:19:13,729 INFO L443 ceAbstractionStarter]: For program point L1819-2(lines 1819 1830) no Hoare annotation was computed. [2019-11-16 00:19:13,729 INFO L443 ceAbstractionStarter]: For program point L762-2(lines 762 770) no Hoare annotation was computed. [2019-11-16 00:19:13,729 INFO L443 ceAbstractionStarter]: For program point L1291(lines 1291 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,729 INFO L443 ceAbstractionStarter]: For program point L1159(lines 1159 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,729 INFO L443 ceAbstractionStarter]: For program point L1556(lines 1556 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,729 INFO L443 ceAbstractionStarter]: For program point L1424(lines 1424 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,729 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,729 INFO L443 ceAbstractionStarter]: For program point L103-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,729 INFO L443 ceAbstractionStarter]: For program point L1028(lines 1028 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,729 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 377) no Hoare annotation was computed. [2019-11-16 00:19:13,729 INFO L443 ceAbstractionStarter]: For program point L368-2(lines 368 377) no Hoare annotation was computed. [2019-11-16 00:19:13,729 INFO L443 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2019-11-16 00:19:13,730 INFO L443 ceAbstractionStarter]: For program point L2086(lines 2086 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,730 INFO L443 ceAbstractionStarter]: For program point L2351(lines 2351 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,730 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,730 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,730 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,730 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,730 INFO L443 ceAbstractionStarter]: For program point L2220(lines 2220 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,730 INFO L443 ceAbstractionStarter]: For program point L106-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,730 INFO L443 ceAbstractionStarter]: For program point L1956(lines 1956 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,730 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 908) no Hoare annotation was computed. [2019-11-16 00:19:13,730 INFO L443 ceAbstractionStarter]: For program point L899-2(lines 899 908) no Hoare annotation was computed. [2019-11-16 00:19:13,730 INFO L443 ceAbstractionStarter]: For program point L1428(lines 1428 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,731 INFO L443 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-11-16 00:19:13,731 INFO L443 ceAbstractionStarter]: For program point L2486(lines 2486 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,731 INFO L443 ceAbstractionStarter]: For program point L1429(lines 1429 1439) no Hoare annotation was computed. [2019-11-16 00:19:13,731 INFO L443 ceAbstractionStarter]: For program point L1429-2(lines 1429 1439) no Hoare annotation was computed. [2019-11-16 00:19:13,731 INFO L443 ceAbstractionStarter]: For program point L1297(lines 1297 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,731 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,731 INFO L443 ceAbstractionStarter]: For program point L1166(lines 1166 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,731 INFO L443 ceAbstractionStarter]: For program point L109-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,731 INFO L443 ceAbstractionStarter]: For program point L1034(lines 1034 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,731 INFO L443 ceAbstractionStarter]: For program point L1563(lines 1563 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,731 INFO L443 ceAbstractionStarter]: For program point L2224(lines 2224 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,731 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-11-16 00:19:13,732 INFO L443 ceAbstractionStarter]: For program point L2092(lines 2092 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,732 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,732 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,732 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,732 INFO L443 ceAbstractionStarter]: For program point L640(lines 640 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,732 INFO L443 ceAbstractionStarter]: For program point L2358(lines 2358 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,732 INFO L443 ceAbstractionStarter]: For program point L112-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,732 INFO L443 ceAbstractionStarter]: For program point L2491(lines 2491 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,732 INFO L443 ceAbstractionStarter]: For program point L113(line 113) no Hoare annotation was computed. [2019-11-16 00:19:13,732 INFO L443 ceAbstractionStarter]: For program point L2095(lines 2095 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,732 INFO L443 ceAbstractionStarter]: For program point L1963(lines 1963 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,732 INFO L443 ceAbstractionStarter]: For program point L1831(lines 1831 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,733 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,733 INFO L443 ceAbstractionStarter]: For program point L1303(lines 1303 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,733 INFO L443 ceAbstractionStarter]: For program point L1964(lines 1964 1974) no Hoare annotation was computed. [2019-11-16 00:19:13,733 INFO L443 ceAbstractionStarter]: For program point L1964-2(lines 1964 1974) no Hoare annotation was computed. [2019-11-16 00:19:13,733 INFO L443 ceAbstractionStarter]: For program point L1700(lines 1700 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,733 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,733 INFO L443 ceAbstractionStarter]: For program point L115-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,733 INFO L443 ceAbstractionStarter]: For program point L1040(lines 1040 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,733 INFO L443 ceAbstractionStarter]: For program point L776(lines 776 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,733 INFO L443 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-11-16 00:19:13,733 INFO L443 ceAbstractionStarter]: For program point L909(lines 909 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,733 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,734 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,735 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,735 INFO L443 ceAbstractionStarter]: For program point L2231(lines 2231 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,735 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,735 INFO L443 ceAbstractionStarter]: For program point L2496(lines 2496 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,735 INFO L443 ceAbstractionStarter]: For program point L2232(lines 2232 2243) no Hoare annotation was computed. [2019-11-16 00:19:13,735 INFO L443 ceAbstractionStarter]: For program point L2232-2(lines 2232 2243) no Hoare annotation was computed. [2019-11-16 00:19:13,736 INFO L443 ceAbstractionStarter]: For program point L118-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,736 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,736 INFO L443 ceAbstractionStarter]: For program point L1440(lines 1440 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,736 INFO L443 ceAbstractionStarter]: For program point L2365(lines 2365 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,736 INFO L443 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2019-11-16 00:19:13,736 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,736 INFO L443 ceAbstractionStarter]: For program point L2101(lines 2101 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,736 INFO L443 ceAbstractionStarter]: For program point L1837(lines 1837 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,737 INFO L443 ceAbstractionStarter]: For program point L913(lines 913 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,737 INFO L443 ceAbstractionStarter]: For program point L781(lines 781 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,737 INFO L443 ceAbstractionStarter]: For program point L1574(lines 1574 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,737 INFO L443 ceAbstractionStarter]: For program point L385(lines 385 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,737 INFO L443 ceAbstractionStarter]: For program point L121-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,737 INFO L443 ceAbstractionStarter]: For program point L1707(lines 1707 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,737 INFO L443 ceAbstractionStarter]: For program point L1575(lines 1575 1581) no Hoare annotation was computed. [2019-11-16 00:19:13,738 INFO L443 ceAbstractionStarter]: For program point L1575-2(lines 1575 1581) no Hoare annotation was computed. [2019-11-16 00:19:13,738 INFO L443 ceAbstractionStarter]: For program point L1179(lines 1179 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,738 INFO L443 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-11-16 00:19:13,738 INFO L443 ceAbstractionStarter]: For program point L1708(lines 1708 1717) no Hoare annotation was computed. [2019-11-16 00:19:13,738 INFO L443 ceAbstractionStarter]: For program point L1708-2(lines 1708 1717) no Hoare annotation was computed. [2019-11-16 00:19:13,738 INFO L443 ceAbstractionStarter]: For program point L1444(lines 1444 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,738 INFO L443 ceAbstractionStarter]: For program point L2105(lines 2105 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,738 INFO L443 ceAbstractionStarter]: For program point L2502(lines 2502 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,739 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,739 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,739 INFO L443 ceAbstractionStarter]: For program point L124-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,739 INFO L443 ceAbstractionStarter]: For program point L2106(lines 2106 2112) no Hoare annotation was computed. [2019-11-16 00:19:13,739 INFO L443 ceAbstractionStarter]: For program point L2106-2(lines 2106 2112) no Hoare annotation was computed. [2019-11-16 00:19:13,739 INFO L443 ceAbstractionStarter]: For program point L1842(lines 1842 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,739 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,740 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,740 INFO L443 ceAbstractionStarter]: For program point L2371(lines 2371 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,740 INFO L443 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2019-11-16 00:19:13,740 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,740 INFO L443 ceAbstractionStarter]: For program point L1975(lines 1975 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,740 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 531) no Hoare annotation was computed. [2019-11-16 00:19:13,740 INFO L443 ceAbstractionStarter]: For program point L522-2(lines 522 531) no Hoare annotation was computed. [2019-11-16 00:19:13,740 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,741 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,741 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,741 INFO L443 ceAbstractionStarter]: For program point L127-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,741 INFO L443 ceAbstractionStarter]: For program point L920(lines 920 929) no Hoare annotation was computed. [2019-11-16 00:19:13,741 INFO L443 ceAbstractionStarter]: For program point L920-2(lines 920 929) no Hoare annotation was computed. [2019-11-16 00:19:13,741 INFO L443 ceAbstractionStarter]: For program point L1845(lines 1845 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,741 INFO L443 ceAbstractionStarter]: For program point L392(lines 392 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,742 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,742 INFO L443 ceAbstractionStarter]: For program point L1185(lines 1185 1196) no Hoare annotation was computed. [2019-11-16 00:19:13,742 INFO L443 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-11-16 00:19:13,742 INFO L443 ceAbstractionStarter]: For program point L1185-2(lines 1185 1196) no Hoare annotation was computed. [2019-11-16 00:19:13,742 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,742 INFO L443 ceAbstractionStarter]: For program point L1979(lines 1979 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,742 INFO L443 ceAbstractionStarter]: For program point L1451(lines 1451 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,743 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,743 INFO L443 ceAbstractionStarter]: For program point L2244(lines 2244 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,743 INFO L443 ceAbstractionStarter]: For program point L130-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,743 INFO L443 ceAbstractionStarter]: For program point L2509(lines 2509 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,743 INFO L443 ceAbstractionStarter]: For program point L2377(lines 2377 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,743 INFO L443 ceAbstractionStarter]: For program point L2245(lines 2245 2255) no Hoare annotation was computed. [2019-11-16 00:19:13,743 INFO L443 ceAbstractionStarter]: For program point L131(line 131) no Hoare annotation was computed. [2019-11-16 00:19:13,743 INFO L443 ceAbstractionStarter]: For program point L2245-2(lines 2245 2255) no Hoare annotation was computed. [2019-11-16 00:19:13,744 INFO L443 ceAbstractionStarter]: For program point L1056(lines 1056 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,744 INFO L443 ceAbstractionStarter]: For program point L2113(lines 2113 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,744 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:19:13,744 INFO L443 ceAbstractionStarter]: For program point L660(lines 660 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,744 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,744 INFO L443 ceAbstractionStarter]: For program point L1718(lines 1718 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,744 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,745 INFO L443 ceAbstractionStarter]: For program point L133-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,745 INFO L443 ceAbstractionStarter]: For program point L1587(lines 1587 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,745 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,745 INFO L443 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2019-11-16 00:19:13,745 INFO L443 ceAbstractionStarter]: For program point L1984(lines 1984 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,745 INFO L443 ceAbstractionStarter]: For program point L1852(lines 1852 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,745 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,745 INFO L443 ceAbstractionStarter]: For program point L532(lines 532 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,746 INFO L443 ceAbstractionStarter]: For program point L2514(lines 2514 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,746 INFO L443 ceAbstractionStarter]: For program point L1457(lines 1457 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,746 INFO L443 ceAbstractionStarter]: For program point L2382(lines 2382 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,746 INFO L443 ceAbstractionStarter]: For program point L136-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,746 INFO L443 ceAbstractionStarter]: For program point L2118(lines 2118 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,746 INFO L443 ceAbstractionStarter]: For program point L1590(lines 1590 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,746 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-11-16 00:19:13,747 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,747 INFO L443 ceAbstractionStarter]: For program point L1723(lines 1723 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,747 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,747 INFO L443 ceAbstractionStarter]: For program point L667(lines 667 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,747 INFO L443 ceAbstractionStarter]: For program point L535(lines 535 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,747 INFO L443 ceAbstractionStarter]: For program point L2517(lines 2517 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,747 INFO L443 ceAbstractionStarter]: For program point L1328(lines 1328 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,748 INFO L443 ceAbstractionStarter]: For program point L139-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,748 INFO L443 ceAbstractionStarter]: For program point L800(lines 800 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,748 INFO L443 ceAbstractionStarter]: For program point L1329(lines 1329 1338) no Hoare annotation was computed. [2019-11-16 00:19:13,748 INFO L443 ceAbstractionStarter]: For program point L1329-2(lines 1329 1338) no Hoare annotation was computed. [2019-11-16 00:19:13,748 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,748 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-16 00:19:13,748 INFO L443 ceAbstractionStarter]: For program point L1858(lines 1858 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,748 INFO L443 ceAbstractionStarter]: For program point L1462(lines 1462 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,749 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,749 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,749 INFO L443 ceAbstractionStarter]: For program point L1991(lines 1991 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,749 INFO L443 ceAbstractionStarter]: For program point L1859(lines 1859 1867) no Hoare annotation was computed. [2019-11-16 00:19:13,749 INFO L443 ceAbstractionStarter]: For program point L1859-2(lines 1859 1867) no Hoare annotation was computed. [2019-11-16 00:19:13,749 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,749 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 415) no Hoare annotation was computed. [2019-11-16 00:19:13,749 INFO L443 ceAbstractionStarter]: For program point L406-2(lines 406 415) no Hoare annotation was computed. [2019-11-16 00:19:13,750 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 286) no Hoare annotation was computed. [2019-11-16 00:19:13,750 INFO L443 ceAbstractionStarter]: For program point L2256(lines 2256 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,750 INFO L443 ceAbstractionStarter]: For program point L274-2(lines 274 286) no Hoare annotation was computed. [2019-11-16 00:19:13,750 INFO L443 ceAbstractionStarter]: For program point L142-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,750 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,750 INFO L443 ceAbstractionStarter]: For program point L1596(lines 1596 1607) no Hoare annotation was computed. [2019-11-16 00:19:13,750 INFO L443 ceAbstractionStarter]: For program point L1596-2(lines 1596 1607) no Hoare annotation was computed. [2019-11-16 00:19:13,751 INFO L443 ceAbstractionStarter]: For program point L2389(lines 2389 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,751 INFO L443 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-11-16 00:19:13,751 INFO L443 ceAbstractionStarter]: For program point L2125(lines 2125 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,751 INFO L443 ceAbstractionStarter]: For program point L2522(lines 2522 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,751 INFO L443 ceAbstractionStarter]: For program point L2390(lines 2390 2402) no Hoare annotation was computed. [2019-11-16 00:19:13,751 INFO L443 ceAbstractionStarter]: For program point L2390-2(lines 2390 2402) no Hoare annotation was computed. [2019-11-16 00:19:13,751 INFO L443 ceAbstractionStarter]: For program point L1069(lines 1069 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,751 INFO L443 ceAbstractionStarter]: For program point L1730(lines 1730 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,752 INFO L443 ceAbstractionStarter]: For program point L673(lines 673 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,752 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,752 INFO L443 ceAbstractionStarter]: For program point L1202(lines 1202 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,752 INFO L443 ceAbstractionStarter]: For program point L145-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,752 INFO L443 ceAbstractionStarter]: For program point L1995(lines 1995 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,752 INFO L443 ceAbstractionStarter]: For program point L1467(lines 1467 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,752 INFO L443 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2019-11-16 00:19:13,752 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,753 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,753 INFO L443 ceAbstractionStarter]: For program point L2129(lines 2129 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,753 INFO L443 ceAbstractionStarter]: For program point L148-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,753 INFO L443 ceAbstractionStarter]: For program point L2527(lines 2527 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,753 INFO L443 ceAbstractionStarter]: For program point L2263(lines 2263 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,753 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-11-16 00:19:13,753 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,754 INFO L443 ceAbstractionStarter]: For program point L2528(lines 2528 2538) no Hoare annotation was computed. [2019-11-16 00:19:13,754 INFO L443 ceAbstractionStarter]: For program point L2528-2(lines 2528 2538) no Hoare annotation was computed. [2019-11-16 00:19:13,754 INFO L443 ceAbstractionStarter]: For program point L1339(lines 1339 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,754 INFO L443 ceAbstractionStarter]: For program point L1868(lines 1868 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,754 INFO L443 ceAbstractionStarter]: For program point L679(lines 679 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,754 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,754 INFO L443 ceAbstractionStarter]: For program point L151-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,754 INFO L443 ceAbstractionStarter]: For program point L1076(lines 1076 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,755 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 557) no Hoare annotation was computed. [2019-11-16 00:19:13,755 INFO L443 ceAbstractionStarter]: For program point L548-2(lines 548 557) no Hoare annotation was computed. [2019-11-16 00:19:13,755 INFO L443 ceAbstractionStarter]: For program point L416(lines 416 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,755 INFO L443 ceAbstractionStarter]: For program point L1209(lines 1209 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,755 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-16 00:19:13,755 INFO L443 ceAbstractionStarter]: For program point L2002(lines 2002 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,755 INFO L443 ceAbstractionStarter]: For program point L1474(lines 1474 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,756 INFO L443 ceAbstractionStarter]: For program point L2135(lines 2135 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,756 INFO L443 ceAbstractionStarter]: For program point L946(lines 946 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,756 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,756 INFO L443 ceAbstractionStarter]: For program point L2268(lines 2268 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,756 INFO L443 ceAbstractionStarter]: For program point L154-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,756 INFO L443 ceAbstractionStarter]: For program point L1608(lines 1608 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,756 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,756 INFO L443 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2019-11-16 00:19:13,757 INFO L443 ceAbstractionStarter]: For program point L1741(lines 1741 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,757 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,757 INFO L443 ceAbstractionStarter]: For program point L1346(lines 1346 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,757 INFO L443 ceAbstractionStarter]: For program point L2403(lines 2403 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,757 INFO L443 ceAbstractionStarter]: For program point L157-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,757 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 27) no Hoare annotation was computed. [2019-11-16 00:19:13,757 INFO L443 ceAbstractionStarter]: For program point L25-2(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,758 INFO L443 ceAbstractionStarter]: For program point L2007(lines 2007 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,758 INFO L443 ceAbstractionStarter]: For program point L1875(lines 1875 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,758 INFO L443 ceAbstractionStarter]: For program point L686(lines 686 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,758 INFO L443 ceAbstractionStarter]: For program point L2404(lines 2404 2415) no Hoare annotation was computed. [2019-11-16 00:19:13,758 INFO L443 ceAbstractionStarter]: For program point L2404-2(lines 2404 2415) no Hoare annotation was computed. [2019-11-16 00:19:13,758 INFO L443 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-11-16 00:19:13,758 INFO L443 ceAbstractionStarter]: For program point L2140(lines 2140 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,758 INFO L443 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2019-11-16 00:19:13,759 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 697) no Hoare annotation was computed. [2019-11-16 00:19:13,759 INFO L443 ceAbstractionStarter]: For program point L687-2(lines 687 697) no Hoare annotation was computed. [2019-11-16 00:19:13,759 INFO L443 ceAbstractionStarter]: For program point L423(lines 423 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,759 INFO L443 ceAbstractionStarter]: For program point L1216(lines 1216 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,759 INFO L443 ceAbstractionStarter]: For program point L952(lines 952 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,759 INFO L443 ceAbstractionStarter]: For program point L820(lines 820 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,759 INFO L443 ceAbstractionStarter]: For program point L1745(lines 1745 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,759 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,760 INFO L443 ceAbstractionStarter]: For program point L1481(lines 1481 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,760 INFO L443 ceAbstractionStarter]: For program point L160-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,760 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:19:13,760 INFO L443 ceAbstractionStarter]: For program point L28-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,760 INFO L443 ceAbstractionStarter]: For program point L2010(lines 2010 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,760 INFO L443 ceAbstractionStarter]: For program point L2539(lines 2539 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,761 INFO L443 ceAbstractionStarter]: For program point L2275(lines 2275 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,761 INFO L443 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2019-11-16 00:19:13,761 INFO L443 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-11-16 00:19:13,761 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,761 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,761 INFO L443 ceAbstractionStarter]: For program point L1352(lines 1352 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,761 INFO L443 ceAbstractionStarter]: For program point L1220(lines 1220 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,761 INFO L443 ceAbstractionStarter]: For program point L163-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,762 INFO L443 ceAbstractionStarter]: For program point L1088(lines 1088 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,762 INFO L443 ceAbstractionStarter]: For program point L2145(lines 2145 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,762 INFO L443 ceAbstractionStarter]: For program point L31-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,762 INFO L443 ceAbstractionStarter]: For program point L1881(lines 1881 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,762 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,762 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,762 INFO L443 ceAbstractionStarter]: For program point L1221(lines 1221 1230) no Hoare annotation was computed. [2019-11-16 00:19:13,763 INFO L443 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2019-11-16 00:19:13,763 INFO L443 ceAbstractionStarter]: For program point L1221-2(lines 1221 1230) no Hoare annotation was computed. [2019-11-16 00:19:13,763 INFO L443 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2019-11-16 00:19:13,763 INFO L443 ceAbstractionStarter]: For program point L826(lines 826 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,763 INFO L443 ceAbstractionStarter]: For program point L2544(lines 2544 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,763 INFO L443 ceAbstractionStarter]: For program point L1487(lines 1487 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,763 INFO L443 ceAbstractionStarter]: For program point L166-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,763 INFO L443 ceAbstractionStarter]: For program point L34-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,764 INFO L443 ceAbstractionStarter]: For program point L2016(lines 2016 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,764 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,764 INFO L443 ceAbstractionStarter]: For program point L1620(lines 1620 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,764 INFO L443 ceAbstractionStarter]: For program point L2281(lines 2281 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,764 INFO L443 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-11-16 00:19:13,764 INFO L443 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2019-11-16 00:19:13,764 INFO L443 ceAbstractionStarter]: For program point L565(lines 565 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,764 INFO L443 ceAbstractionStarter]: For program point L1490(lines 1490 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,765 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,765 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,765 INFO L443 ceAbstractionStarter]: For program point L169-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,765 INFO L443 ceAbstractionStarter]: For program point L1094(lines 1094 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,765 INFO L443 ceAbstractionStarter]: For program point L37-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,765 INFO L443 ceAbstractionStarter]: For program point L698(lines 698 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,765 INFO L443 ceAbstractionStarter]: For program point L2416(lines 2416 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,765 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,766 INFO L443 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-11-16 00:19:13,766 INFO L443 ceAbstractionStarter]: For program point L2152(lines 2152 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,766 INFO L443 ceAbstractionStarter]: For program point L38(line 38) no Hoare annotation was computed. [2019-11-16 00:19:13,766 INFO L443 ceAbstractionStarter]: For program point L2020(lines 2020 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,766 INFO L443 ceAbstractionStarter]: For program point L1888(lines 1888 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,766 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,766 INFO L443 ceAbstractionStarter]: For program point L1756(lines 1756 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,766 INFO L443 ceAbstractionStarter]: For program point L2021(lines 2021 2030) no Hoare annotation was computed. [2019-11-16 00:19:13,767 INFO L443 ceAbstractionStarter]: For program point L2021-2(lines 2021 2030) no Hoare annotation was computed. [2019-11-16 00:19:13,767 INFO L443 ceAbstractionStarter]: For program point L172-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,767 INFO L443 ceAbstractionStarter]: For program point L40-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,767 INFO L443 ceAbstractionStarter]: For program point L1626(lines 1626 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,767 INFO L443 ceAbstractionStarter]: For program point L2551(lines 2551 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,767 INFO L443 ceAbstractionStarter]: For program point L2287(lines 2287 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,767 INFO L443 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-11-16 00:19:13,767 INFO L443 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-11-16 00:19:13,768 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,768 INFO L443 ceAbstractionStarter]: For program point L570(lines 570 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,768 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,768 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,768 INFO L443 ceAbstractionStarter]: For program point L703(lines 703 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,768 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,768 INFO L443 ceAbstractionStarter]: For program point L1364(lines 1364 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,768 INFO L443 ceAbstractionStarter]: For program point L175-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,769 INFO L443 ceAbstractionStarter]: For program point L1100(lines 1100 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,769 INFO L443 ceAbstractionStarter]: For program point L2157(lines 2157 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,769 INFO L443 ceAbstractionStarter]: For program point L43-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,769 INFO L443 ceAbstractionStarter]: For program point L1497(lines 1497 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,769 INFO L443 ceAbstractionStarter]: For program point L2422(lines 2422 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,769 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1376) no Hoare annotation was computed. [2019-11-16 00:19:13,769 INFO L443 ceAbstractionStarter]: For program point L1365-2(lines 1365 1376) no Hoare annotation was computed. [2019-11-16 00:19:13,769 INFO L443 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2019-11-16 00:19:13,770 INFO L443 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-11-16 00:19:13,770 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,770 INFO L443 ceAbstractionStarter]: For program point L1895(lines 1895 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,770 INFO L443 ceAbstractionStarter]: For program point L838(lines 838 846) no Hoare annotation was computed. [2019-11-16 00:19:13,770 INFO L443 ceAbstractionStarter]: For program point L838-2(lines 838 846) no Hoare annotation was computed. [2019-11-16 00:19:13,770 INFO L443 ceAbstractionStarter]: For program point L1763(lines 1763 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,770 INFO L443 ceAbstractionStarter]: For program point L178-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,770 INFO L443 ceAbstractionStarter]: For program point L46-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,771 INFO L443 ceAbstractionStarter]: For program point L1632(lines 1632 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,771 INFO L443 ceAbstractionStarter]: For program point L2557(lines 2557 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,771 INFO L443 ceAbstractionStarter]: For program point L2293(lines 2293 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,771 INFO L443 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2019-11-16 00:19:13,771 INFO L443 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-11-16 00:19:13,771 INFO L443 ceAbstractionStarter]: For program point L972(lines 972 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,771 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,771 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,772 INFO L443 ceAbstractionStarter]: For program point L709(lines 709 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,772 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,772 INFO L443 ceAbstractionStarter]: For program point L181-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,772 INFO L443 ceAbstractionStarter]: For program point L1106(lines 1106 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,772 INFO L443 ceAbstractionStarter]: For program point L2163(lines 2163 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,772 INFO L443 ceAbstractionStarter]: For program point L49-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,772 INFO L443 ceAbstractionStarter]: For program point L2031(lines 2031 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,772 INFO L443 ceAbstractionStarter]: For program point L710(lines 710 718) no Hoare annotation was computed. [2019-11-16 00:19:13,773 INFO L443 ceAbstractionStarter]: For program point L710-2(lines 710 718) no Hoare annotation was computed. [2019-11-16 00:19:13,773 INFO L443 ceAbstractionStarter]: For program point L446(lines 446 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,773 INFO L443 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-11-16 00:19:13,773 INFO L443 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-11-16 00:19:13,773 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,773 INFO L443 ceAbstractionStarter]: For program point L1900(lines 1900 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,773 INFO L443 ceAbstractionStarter]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,773 INFO L443 ceAbstractionStarter]: For program point L1504(lines 1504 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,774 INFO L443 ceAbstractionStarter]: For program point L2429(lines 2429 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,774 INFO L443 ceAbstractionStarter]: For program point L2297(lines 2297 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,774 INFO L443 ceAbstractionStarter]: For program point L2430(lines 2430 2439) no Hoare annotation was computed. [2019-11-16 00:19:13,774 INFO L443 ceAbstractionStarter]: For program point L2430-2(lines 2430 2439) no Hoare annotation was computed. [2019-11-16 00:19:13,774 INFO L443 ceAbstractionStarter]: For program point L184-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,774 INFO L443 ceAbstractionStarter]: For program point L52-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,774 INFO L443 ceAbstractionStarter]: For program point L1770(lines 1770 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,774 INFO L443 ceAbstractionStarter]: For program point L2563(lines 2563 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,775 INFO L443 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2019-11-16 00:19:13,775 INFO L443 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2019-11-16 00:19:13,775 INFO L443 ceAbstractionStarter]: For program point L582(lines 582 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,775 INFO L443 ceAbstractionStarter]: For program point L2168(lines 2168 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,775 INFO L443 ceAbstractionStarter]: For program point L847(lines 847 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,775 INFO L443 ceAbstractionStarter]: For program point L451(lines 451 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,775 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,775 INFO L443 ceAbstractionStarter]: For program point L1244(lines 1244 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,776 INFO L443 ceAbstractionStarter]: For program point L187-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,776 INFO L443 ceAbstractionStarter]: For program point L55-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,776 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 858) no Hoare annotation was computed. [2019-11-16 00:19:13,776 INFO L443 ceAbstractionStarter]: For program point L848-2(lines 848 858) no Hoare annotation was computed. [2019-11-16 00:19:13,776 INFO L443 ceAbstractionStarter]: For program point L1377(lines 1377 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,776 INFO L443 ceAbstractionStarter]: For program point L2302(lines 2302 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,776 INFO L443 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-11-16 00:19:13,777 INFO L443 ceAbstractionStarter]: For program point L1113(lines 1113 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,777 INFO L443 ceAbstractionStarter]: For program point L56(line 56) no Hoare annotation was computed. [2019-11-16 00:19:13,777 INFO L443 ceAbstractionStarter]: For program point L2038(lines 2038 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,777 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,777 INFO L443 ceAbstractionStarter]: For program point L1906(lines 1906 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,777 INFO L443 ceAbstractionStarter]: For program point L1510(lines 1510 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,777 INFO L443 ceAbstractionStarter]: For program point L1907(lines 1907 1915) no Hoare annotation was computed. [2019-11-16 00:19:13,777 INFO L443 ceAbstractionStarter]: For program point L1907-2(lines 1907 1915) no Hoare annotation was computed. [2019-11-16 00:19:13,778 INFO L439 ceAbstractionStarter]: At program point L1643(lines 24 1644) the Hoare annotation is: (let ((.cse32 (+ ~a14~0 182))) (let ((.cse24 (<= .cse32 0)) (.cse23 (<= (+ ~a26~0 68) 0)) (.cse10 (<= ~a28~0 134)) (.cse30 (< 124 ~a26~0)) (.cse33 (+ ~a14~0 114)) (.cse20 (<= (* 9 ~a26~0) (+ (* 10 ~a28~0) 2892136))) (.cse19 (< 37 ~a28~0)) (.cse11 (= ~a24~0 1)) (.cse26 (<= ~a26~0 217))) (let ((.cse12 (exists ((v_~a28~0_1300 Int)) (let ((.cse34 (+ (div (+ v_~a28~0_1300 (- 600036)) 5) 1))) (and (<= ~a28~0 (div .cse34 5)) (<= v_~a28~0_1300 111) (not (= 0 (mod (+ v_~a28~0_1300 4) 5))) (< v_~a28~0_1300 600036) (= (mod .cse34 5) 0))))) (.cse3 (<= 301 ~a28~0)) (.cse0 (and .cse11 .cse26)) (.cse18 (<= ~a28~0 300)) (.cse17 (or .cse20 .cse19)) (.cse16 (< 217 ~a26~0)) (.cse27 (not (= 2 ULTIMATE.start_calculate_output_~input))) (.cse1 (< 0 .cse33)) (.cse22 (<= ~a28~0 111)) (.cse29 (<= (+ ~a14~0 84) 0)) (.cse9 (<= ~a26~0 348799)) (.cse28 (and .cse30 .cse11)) (.cse2 (<= 0 (+ ~a14~0 600000))) (.cse13 (= ~a24~0 2)) (.cse31 (or .cse23 .cse10)) (.cse6 (or (<= (+ ~a26~0 ~a14~0 1052964) 0) .cse24)) (.cse15 (<= ~a26~0 124)) (.cse4 (= ~a24~0 3)) (.cse25 (<= .cse33 0)) (.cse21 (<= ~a26~0 215)) (.cse7 (<= ~a21~0 124)) (.cse8 (<= ~a28~0 599997)) (.cse14 (< 0 .cse32))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 (exists ((v_~a28~0_1304 Int)) (let ((.cse5 (div (* v_~a28~0_1304 9) 10))) (and (<= ~a28~0 (+ (mod .cse5 299849) 300149)) (<= 0 (* 9 v_~a28~0_1304)) (<= 0 .cse5)))) .cse6 .cse7) (and .cse4 (<= (+ ~a26~0 554655) 0) .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse7) (and .cse11 .cse12) (and .cse13 .cse7 .cse14 .cse15) (and .cse2 .cse16 .cse17 .cse4 .cse7 .cse18 (or (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse19) .cse6) (and .cse20 .cse2 .cse4 .cse21 .cse7 .cse22 .cse6) (and .cse13 .cse8 .cse7) (and .cse18 .cse4 .cse15 .cse7) (and .cse11 (or .cse23 .cse24)) (and .cse4 .cse25 .cse26 .cse7 .cse27 .cse14 .cse12) (and .cse3 .cse0 .cse7) (and (and .cse18 .cse28 .cse7) (<= (div (+ (- ~a26~0) 557256) (- 20)) 124)) (and .cse13 .cse25 .cse14 (<= 222 ~a26~0) .cse7) (and (and .cse17 (and (or .cse16 .cse19 .cse27) .cse4 .cse25 .cse14 .cse7)) .cse10) (and .cse13 .cse1 .cse29 .cse7) (and .cse11 .cse22 .cse29) (and .cse30 .cse2 .cse13 .cse26 .cse6 .cse7) (and .cse28 .cse29) (and .cse9 .cse8 (and .cse28 .cse7)) (and .cse2 .cse13 .cse31 .cse7) (and .cse4 .cse25 .cse7 .cse14 .cse15) (and .cse31 .cse4 .cse7 .cse8 .cse6 .cse15) (and .cse20 .cse4 .cse25 .cse21 .cse7 .cse8 .cse14))))) [2019-11-16 00:19:13,778 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:19:13,779 INFO L443 ceAbstractionStarter]: For program point L190-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,779 INFO L443 ceAbstractionStarter]: For program point L2172(lines 2172 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,779 INFO L443 ceAbstractionStarter]: For program point L58-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,779 INFO L443 ceAbstractionStarter]: For program point L719(lines 719 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,779 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,779 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,779 INFO L443 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2019-11-16 00:19:13,779 INFO L443 ceAbstractionStarter]: For program point L59(line 59) no Hoare annotation was computed. [2019-11-16 00:19:13,780 INFO L443 ceAbstractionStarter]: For program point L1777(lines 1777 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,780 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,780 INFO L439 ceAbstractionStarter]: At program point L2571(lines 1646 2572) the Hoare annotation is: (let ((.cse32 (+ ~a14~0 182))) (let ((.cse25 (<= .cse32 0)) (.cse24 (<= (+ ~a26~0 68) 0)) (.cse12 (<= ~a28~0 134)) (.cse30 (< 124 ~a26~0)) (.cse0 (= ~a24~0 1)) (.cse33 (+ ~a14~0 114)) (.cse21 (<= (* 9 ~a26~0) (+ (* 10 ~a28~0) 2892136))) (.cse20 (< 37 ~a28~0))) (let ((.cse11 (<= ~a26~0 348799)) (.cse4 (<= 301 ~a28~0)) (.cse19 (<= ~a28~0 300)) (.cse18 (or .cse21 .cse20)) (.cse17 (< 217 ~a26~0)) (.cse28 (not (= 2 ULTIMATE.start_calculate_output_~input))) (.cse2 (< 0 .cse33)) (.cse23 (<= ~a28~0 111)) (.cse1 (<= ~a26~0 217)) (.cse16 (and .cse30 .cse0)) (.cse29 (<= (+ ~a14~0 84) 0)) (.cse3 (<= 0 (+ ~a14~0 600000))) (.cse10 (= ~a24~0 2)) (.cse31 (or .cse24 .cse12)) (.cse7 (or (<= (+ ~a26~0 ~a14~0 1052964) 0) .cse25)) (.cse15 (<= ~a26~0 124)) (.cse5 (= ~a24~0 3)) (.cse27 (<= .cse33 0)) (.cse22 (<= ~a26~0 215)) (.cse8 (<= ~a21~0 124)) (.cse9 (<= ~a28~0 599997)) (.cse14 (< 0 .cse32))) (or (and (and .cse0 .cse1) .cse2) (and .cse3 .cse4 .cse5 (exists ((v_~a28~0_1304 Int)) (let ((.cse6 (div (* v_~a28~0_1304 9) 10))) (and (<= ~a28~0 (+ (mod .cse6 299849) 300149)) (<= 0 (* 9 v_~a28~0_1304)) (<= 0 .cse6)))) .cse7 .cse8) (and .cse5 (<= (+ ~a26~0 554655) 0) .cse8 .cse9) (and .cse10 .cse9 .cse8) (and .cse11 .cse12 .cse0 .cse8) (and .cse0 (exists ((v_~a28~0_1300 Int)) (let ((.cse13 (+ (div (+ v_~a28~0_1300 (- 600036)) 5) 1))) (and (<= ~a28~0 (div .cse13 5)) (<= v_~a28~0_1300 111) (not (= 0 (mod (+ v_~a28~0_1300 4) 5))) (< v_~a28~0_1300 600036) (= (mod .cse13 5) 0))))) (and .cse10 .cse8 .cse14 .cse15) (and .cse11 (and .cse16 .cse8) .cse9) (and .cse3 .cse17 .cse18 .cse5 .cse8 .cse19 (or (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse20) .cse7) (and .cse21 .cse3 .cse5 .cse22 .cse8 .cse23 .cse7) (and .cse19 .cse5 .cse15 .cse8) (and .cse0 (or .cse24 .cse25)) (and (exists ((v_prenex_7 Int)) (let ((.cse26 (div (* v_prenex_7 9) 10))) (and (<= 0 (* 9 v_prenex_7)) (<= (+ ~a28~0 299969) (mod .cse26 299849)) (<= 0 .cse26)))) .cse5 .cse27 .cse1 .cse8 .cse28 .cse14) (and .cse4 (and .cse0 .cse29) .cse8) (and (and .cse19 .cse16 .cse8) (<= (div (+ (- ~a26~0) 557256) (- 20)) 124)) (and .cse10 .cse27 .cse14 (<= 222 ~a26~0) .cse8) (and (and .cse18 (and (or .cse17 .cse20 .cse28) .cse5 .cse27 .cse14 .cse8)) .cse12) (and .cse10 .cse2 .cse29 .cse8) (and .cse0 .cse23 .cse29) (and .cse30 .cse3 .cse10 .cse1 .cse7 .cse8) (and .cse16 .cse29) (and .cse3 .cse10 .cse31 .cse8) (and .cse5 .cse27 .cse8 .cse14 .cse15) (and .cse31 .cse5 .cse8 .cse9 .cse7 .cse15) (and .cse21 .cse5 .cse27 .cse22 .cse8 .cse9 .cse14))))) [2019-11-16 00:19:13,780 INFO L443 ceAbstractionStarter]: For program point L2307(lines 2307 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,781 INFO L443 ceAbstractionStarter]: For program point L193-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,781 INFO L443 ceAbstractionStarter]: For program point L61-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,781 INFO L443 ceAbstractionStarter]: For program point L2043(lines 2043 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,781 INFO L443 ceAbstractionStarter]: For program point L1515(lines 1515 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,781 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,781 INFO L443 ceAbstractionStarter]: For program point L2440(lines 2440 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,781 INFO L443 ceAbstractionStarter]: For program point L1383(lines 1383 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,781 INFO L443 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2019-11-16 00:19:13,782 INFO L443 ceAbstractionStarter]: For program point L1119(lines 1119 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,782 INFO L443 ceAbstractionStarter]: For program point L62(line 62) no Hoare annotation was computed. [2019-11-16 00:19:13,782 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,782 INFO L443 ceAbstractionStarter]: For program point L1649(lines 1649 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,782 INFO L446 ceAbstractionStarter]: At program point L2574(lines 2574 2590) the Hoare annotation is: true [2019-11-16 00:19:13,782 INFO L443 ceAbstractionStarter]: For program point L196-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,782 INFO L443 ceAbstractionStarter]: For program point L2178(lines 2178 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,783 INFO L443 ceAbstractionStarter]: For program point L64-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,783 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,783 INFO L443 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-11-16 00:19:13,783 INFO L443 ceAbstractionStarter]: For program point L65(line 65) no Hoare annotation was computed. [2019-11-16 00:19:13,783 INFO L443 ceAbstractionStarter]: For program point L726(lines 726 736) no Hoare annotation was computed. [2019-11-16 00:19:13,783 INFO L443 ceAbstractionStarter]: For program point L726-2(lines 726 736) no Hoare annotation was computed. [2019-11-16 00:19:13,783 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,783 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,784 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,784 INFO L443 ceAbstractionStarter]: For program point L1916(lines 1916 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,784 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,784 INFO L443 ceAbstractionStarter]: For program point L1784(lines 1784 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,784 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,784 INFO L443 ceAbstractionStarter]: For program point L2313(lines 2313 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,784 INFO L443 ceAbstractionStarter]: For program point L199-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,784 INFO L443 ceAbstractionStarter]: For program point L67-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,785 INFO L443 ceAbstractionStarter]: For program point L1521(lines 1521 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,785 INFO L443 ceAbstractionStarter]: For program point L2446(lines 2446 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,785 INFO L443 ceAbstractionStarter]: For program point L1389(lines 1389 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,785 INFO L443 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-11-16 00:19:13,785 INFO L443 ceAbstractionStarter]: For program point L1125(lines 1125 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,785 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-16 00:19:13,785 INFO L443 ceAbstractionStarter]: For program point L2050(lines 2050 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,785 INFO L443 ceAbstractionStarter]: For program point L1654(lines 1654 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,786 INFO L439 ceAbstractionStarter]: At program point L2580-2(lines 2580 2589) the Hoare annotation is: (let ((.cse32 (+ ~a14~0 182))) (let ((.cse24 (<= .cse32 0)) (.cse23 (<= (+ ~a26~0 68) 0)) (.cse10 (<= ~a28~0 134)) (.cse30 (< 124 ~a26~0)) (.cse33 (+ ~a14~0 114)) (.cse20 (<= (* 9 ~a26~0) (+ (* 10 ~a28~0) 2892136))) (.cse19 (< 37 ~a28~0)) (.cse11 (= ~a24~0 1)) (.cse26 (<= ~a26~0 217))) (let ((.cse12 (exists ((v_~a28~0_1300 Int)) (let ((.cse34 (+ (div (+ v_~a28~0_1300 (- 600036)) 5) 1))) (and (<= ~a28~0 (div .cse34 5)) (<= v_~a28~0_1300 111) (not (= 0 (mod (+ v_~a28~0_1300 4) 5))) (< v_~a28~0_1300 600036) (= (mod .cse34 5) 0))))) (.cse3 (<= 301 ~a28~0)) (.cse0 (and .cse11 .cse26)) (.cse18 (<= ~a28~0 300)) (.cse17 (or .cse20 .cse19)) (.cse16 (< 217 ~a26~0)) (.cse27 (not (= 2 ULTIMATE.start_calculate_output_~input))) (.cse1 (< 0 .cse33)) (.cse22 (<= ~a28~0 111)) (.cse29 (<= (+ ~a14~0 84) 0)) (.cse9 (<= ~a26~0 348799)) (.cse28 (and .cse30 .cse11)) (.cse2 (<= 0 (+ ~a14~0 600000))) (.cse13 (= ~a24~0 2)) (.cse31 (or .cse23 .cse10)) (.cse6 (or (<= (+ ~a26~0 ~a14~0 1052964) 0) .cse24)) (.cse15 (<= ~a26~0 124)) (.cse4 (= ~a24~0 3)) (.cse25 (<= .cse33 0)) (.cse21 (<= ~a26~0 215)) (.cse7 (<= ~a21~0 124)) (.cse8 (<= ~a28~0 599997)) (.cse14 (< 0 .cse32))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 (exists ((v_~a28~0_1304 Int)) (let ((.cse5 (div (* v_~a28~0_1304 9) 10))) (and (<= ~a28~0 (+ (mod .cse5 299849) 300149)) (<= 0 (* 9 v_~a28~0_1304)) (<= 0 .cse5)))) .cse6 .cse7) (and .cse4 (<= (+ ~a26~0 554655) 0) .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse7) (and .cse11 .cse12) (and .cse13 .cse7 .cse14 .cse15) (and .cse2 .cse16 .cse17 .cse4 .cse7 .cse18 (or (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse19) .cse6) (and .cse20 .cse2 .cse4 .cse21 .cse7 .cse22 .cse6) (and .cse13 .cse8 .cse7) (and .cse18 .cse4 .cse15 .cse7) (and .cse11 (or .cse23 .cse24)) (and .cse4 .cse25 .cse26 .cse7 .cse27 .cse14 .cse12) (and .cse3 .cse0 .cse7) (and (and .cse18 .cse28 .cse7) (<= (div (+ (- ~a26~0) 557256) (- 20)) 124)) (and .cse13 .cse25 .cse14 (<= 222 ~a26~0) .cse7) (and (and .cse17 (and (or .cse16 .cse19 .cse27) .cse4 .cse25 .cse14 .cse7)) .cse10) (and .cse13 .cse1 .cse29 .cse7) (and .cse11 .cse22 .cse29) (and .cse30 .cse2 .cse13 .cse26 .cse6 .cse7) (and .cse28 .cse29) (and .cse9 .cse8 (and .cse28 .cse7)) (and .cse2 .cse13 .cse31 .cse7) (and .cse4 .cse25 .cse7 .cse14 .cse15) (and .cse31 .cse4 .cse7 .cse8 .cse6 .cse15) (and .cse20 .cse4 .cse25 .cse21 .cse7 .cse8 .cse14))))) [2019-11-16 00:19:13,786 INFO L443 ceAbstractionStarter]: For program point L202-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,786 INFO L443 ceAbstractionStarter]: For program point L70-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,787 INFO L443 ceAbstractionStarter]: For program point L995(lines 995 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,787 INFO L443 ceAbstractionStarter]: For program point L599(lines 599 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,787 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,787 INFO L443 ceAbstractionStarter]: For program point L2317(lines 2317 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,787 INFO L443 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-11-16 00:19:13,787 INFO L443 ceAbstractionStarter]: For program point L2185(lines 2185 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,787 INFO L443 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-11-16 00:19:13,787 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 605) no Hoare annotation was computed. [2019-11-16 00:19:13,788 INFO L443 ceAbstractionStarter]: For program point L600-2(lines 600 605) no Hoare annotation was computed. [2019-11-16 00:19:13,788 INFO L443 ceAbstractionStarter]: For program point L1525(lines 1525 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,788 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,788 INFO L443 ceAbstractionStarter]: For program point L2318(lines 2318 2329) no Hoare annotation was computed. [2019-11-16 00:19:13,788 INFO L443 ceAbstractionStarter]: For program point L2318-2(lines 2318 2329) no Hoare annotation was computed. [2019-11-16 00:19:13,788 INFO L443 ceAbstractionStarter]: For program point L2186(lines 2186 2196) no Hoare annotation was computed. [2019-11-16 00:19:13,788 INFO L443 ceAbstractionStarter]: For program point L2186-2(lines 2186 2196) no Hoare annotation was computed. [2019-11-16 00:19:13,788 INFO L443 ceAbstractionStarter]: For program point L1922(lines 1922 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,789 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,789 INFO L443 ceAbstractionStarter]: For program point L1262(lines 1262 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,789 INFO L443 ceAbstractionStarter]: For program point L205-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,789 INFO L443 ceAbstractionStarter]: For program point L1130(lines 1130 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,789 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,789 INFO L443 ceAbstractionStarter]: For program point L1791(lines 1791 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,789 INFO L443 ceAbstractionStarter]: For program point L1659(lines 1659 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,789 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,790 INFO L443 ceAbstractionStarter]: For program point L206(line 206) no Hoare annotation was computed. [2019-11-16 00:19:13,790 INFO L443 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-11-16 00:19:13,790 INFO L443 ceAbstractionStarter]: For program point L999(lines 999 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,790 INFO L443 ceAbstractionStarter]: For program point L1792(lines 1792 1800) no Hoare annotation was computed. [2019-11-16 00:19:13,790 INFO L443 ceAbstractionStarter]: For program point L1792-2(lines 1792 1800) no Hoare annotation was computed. [2019-11-16 00:19:13,790 INFO L443 ceAbstractionStarter]: For program point L2585(line 2585) no Hoare annotation was computed. [2019-11-16 00:19:13,790 INFO L443 ceAbstractionStarter]: For program point L1396(lines 1396 1405) no Hoare annotation was computed. [2019-11-16 00:19:13,791 INFO L443 ceAbstractionStarter]: For program point L2453(lines 2453 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,791 INFO L443 ceAbstractionStarter]: For program point L1396-2(lines 1396 1405) no Hoare annotation was computed. [2019-11-16 00:19:13,791 INFO L443 ceAbstractionStarter]: For program point L2057(lines 2057 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,791 INFO L443 ceAbstractionStarter]: For program point L76-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,791 INFO L443 ceAbstractionStarter]: For program point L737(lines 737 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,791 INFO L443 ceAbstractionStarter]: For program point L77(line 77) no Hoare annotation was computed. [2019-11-16 00:19:13,791 INFO L443 ceAbstractionStarter]: For program point L1927(lines 1927 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,791 INFO L443 ceAbstractionStarter]: For program point L1663(lines 1663 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,792 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,792 INFO L443 ceAbstractionStarter]: For program point L1531(lines 1531 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,792 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,792 INFO L443 ceAbstractionStarter]: For program point L1267(lines 1267 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,792 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,792 INFO L443 ceAbstractionStarter]: For program point L871(lines 871 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,792 INFO L443 ceAbstractionStarter]: For program point L607(lines 607 617) no Hoare annotation was computed. [2019-11-16 00:19:13,792 INFO L443 ceAbstractionStarter]: For program point L607-2(lines 607 617) no Hoare annotation was computed. [2019-11-16 00:19:13,793 INFO L443 ceAbstractionStarter]: For program point L475(lines 475 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,793 INFO L443 ceAbstractionStarter]: For program point L79-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,793 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-16 00:19:13,793 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,793 INFO L443 ceAbstractionStarter]: For program point L2063(lines 2063 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,793 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,793 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,793 INFO L443 ceAbstractionStarter]: For program point L2460(lines 2460 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,794 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,794 INFO L443 ceAbstractionStarter]: For program point L1932(lines 1932 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,794 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,794 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,794 INFO L443 ceAbstractionStarter]: For program point L1272(lines 1272 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,794 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,794 INFO L443 ceAbstractionStarter]: For program point L2197(lines 2197 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,794 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-11-16 00:19:13,795 INFO L443 ceAbstractionStarter]: For program point L1933(lines 1933 1944) no Hoare annotation was computed. [2019-11-16 00:19:13,795 INFO L443 ceAbstractionStarter]: For program point L1933-2(lines 1933 1944) no Hoare annotation was computed. [2019-11-16 00:19:13,795 INFO L443 ceAbstractionStarter]: For program point L1801(lines 1801 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,795 INFO L443 ceAbstractionStarter]: For program point L2330(lines 2330 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,795 INFO L443 ceAbstractionStarter]: For program point L1670(lines 1670 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,795 INFO L443 ceAbstractionStarter]: For program point L1538(lines 1538 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,795 INFO L443 ceAbstractionStarter]: For program point L1406(lines 1406 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,795 INFO L443 ceAbstractionStarter]: For program point L1142(lines 1142 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,796 INFO L443 ceAbstractionStarter]: For program point L85-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,796 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:19:13,796 INFO L443 ceAbstractionStarter]: For program point L86(line 86) no Hoare annotation was computed. [2019-11-16 00:19:13,796 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,796 INFO L443 ceAbstractionStarter]: For program point L2069(lines 2069 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,796 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,796 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,796 INFO L443 ceAbstractionStarter]: For program point L2334(lines 2334 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,797 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,797 INFO L443 ceAbstractionStarter]: For program point L88-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,797 INFO L443 ceAbstractionStarter]: For program point L749(lines 749 760) no Hoare annotation was computed. [2019-11-16 00:19:13,797 INFO L443 ceAbstractionStarter]: For program point L749-2(lines 749 760) no Hoare annotation was computed. [2019-11-16 00:19:13,797 INFO L443 ceAbstractionStarter]: For program point L2467(lines 2467 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,797 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 185) no Hoare annotation was computed. [2019-11-16 00:19:13,797 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,798 INFO L443 ceAbstractionStarter]: For program point L2203(lines 2203 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,798 INFO L443 ceAbstractionStarter]: For program point L89(line 89) no Hoare annotation was computed. [2019-11-16 00:19:13,798 INFO L443 ceAbstractionStarter]: For program point L1807(lines 1807 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,798 INFO L443 ceAbstractionStarter]: For program point L618(lines 618 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,798 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,798 INFO L443 ceAbstractionStarter]: For program point L1279(lines 1279 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,798 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,798 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,799 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,799 INFO L443 ceAbstractionStarter]: For program point L884(lines 884 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,799 INFO L443 ceAbstractionStarter]: For program point L1677(lines 1677 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,799 INFO L443 ceAbstractionStarter]: For program point L1545(lines 1545 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,799 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,799 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-11-16 00:19:13,799 INFO L443 ceAbstractionStarter]: For program point L2074(lines 2074 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,800 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1027) no Hoare annotation was computed. [2019-11-16 00:19:13,800 INFO L443 ceAbstractionStarter]: For program point L1017-2(lines 1017 1027) no Hoare annotation was computed. [2019-11-16 00:19:13,800 INFO L443 ceAbstractionStarter]: For program point L1546(lines 1546 1550) no Hoare annotation was computed. [2019-11-16 00:19:13,800 INFO L443 ceAbstractionStarter]: For program point L1546-2(lines 1546 1550) no Hoare annotation was computed. [2019-11-16 00:19:13,800 INFO L443 ceAbstractionStarter]: For program point L1414(lines 1414 1423) no Hoare annotation was computed. [2019-11-16 00:19:13,800 INFO L443 ceAbstractionStarter]: For program point L1414-2(lines 1414 1423) no Hoare annotation was computed. [2019-11-16 00:19:13,800 INFO L443 ceAbstractionStarter]: For program point L2339(lines 2339 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,800 INFO L443 ceAbstractionStarter]: For program point L2075(lines 2075 2085) no Hoare annotation was computed. [2019-11-16 00:19:13,801 INFO L443 ceAbstractionStarter]: For program point L2075-2(lines 2075 2085) no Hoare annotation was computed. [2019-11-16 00:19:13,801 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,801 INFO L443 ceAbstractionStarter]: For program point L2472(lines 2472 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,801 INFO L443 ceAbstractionStarter]: For program point L2340(lines 2340 2350) no Hoare annotation was computed. [2019-11-16 00:19:13,801 INFO L443 ceAbstractionStarter]: For program point L2340-2(lines 2340 2350) no Hoare annotation was computed. [2019-11-16 00:19:13,801 INFO L443 ceAbstractionStarter]: For program point L94-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,801 INFO L443 ceAbstractionStarter]: For program point L1812(lines 1812 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,801 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,802 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,802 INFO L443 ceAbstractionStarter]: For program point L2209(lines 2209 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,802 INFO L443 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-11-16 00:19:13,802 INFO L443 ceAbstractionStarter]: For program point L1945(lines 1945 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,802 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,802 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,802 INFO L443 ceAbstractionStarter]: For program point L2210(lines 2210 2219) no Hoare annotation was computed. [2019-11-16 00:19:13,802 INFO L443 ceAbstractionStarter]: For program point L2210-2(lines 2210 2219) no Hoare annotation was computed. [2019-11-16 00:19:13,803 INFO L443 ceAbstractionStarter]: For program point L1682(lines 1682 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,803 INFO L443 ceAbstractionStarter]: For program point L625(lines 625 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,803 INFO L443 ceAbstractionStarter]: For program point L2475(lines 2475 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,803 INFO L443 ceAbstractionStarter]: For program point L97-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,803 INFO L443 ceAbstractionStarter]: For program point L1683(lines 1683 1693) no Hoare annotation was computed. [2019-11-16 00:19:13,803 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 633) no Hoare annotation was computed. [2019-11-16 00:19:13,803 INFO L443 ceAbstractionStarter]: For program point L1683-2(lines 1683 1693) no Hoare annotation was computed. [2019-11-16 00:19:13,803 INFO L443 ceAbstractionStarter]: For program point L626-2(lines 626 633) no Hoare annotation was computed. [2019-11-16 00:19:13,804 INFO L443 ceAbstractionStarter]: For program point L1551(lines 1551 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,804 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-11-16 00:19:13,804 INFO L443 ceAbstractionStarter]: For program point L891(lines 891 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,804 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,804 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 24 1644) no Hoare annotation was computed. [2019-11-16 00:19:13,804 INFO L443 ceAbstractionStarter]: For program point L1950(lines 1950 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,804 INFO L443 ceAbstractionStarter]: For program point L1818(lines 1818 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,804 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,805 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1642) no Hoare annotation was computed. [2019-11-16 00:19:13,805 INFO L443 ceAbstractionStarter]: For program point L2479(lines 2479 2570) no Hoare annotation was computed. [2019-11-16 00:19:13,805 INFO L443 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-11-16 00:19:13,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:13,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:13,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:13,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,819 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,819 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,820 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,820 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,820 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,820 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,821 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:13,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:13,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:13,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,837 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:13,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:13,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:13,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-11-16 00:19:13,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-11-16 00:19:13,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-11-16 00:19:13,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:13,846 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:13,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:13,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,847 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,848 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-11-16 00:19:13,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-11-16 00:19:13,849 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-11-16 00:19:13,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:13,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:13,852 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:13,853 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,853 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,855 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,855 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,855 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:13,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:13,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:13,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:13,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:19:13 BoogieIcfgContainer [2019-11-16 00:19:13,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:19:13,866 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:19:13,866 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:19:13,866 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:19:13,867 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:07:09" (3/4) ... [2019-11-16 00:19:13,870 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:19:13,910 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-16 00:19:13,915 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:19:13,946 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((a24 == 1 && a26 <= 217) && 0 < a14 + 114) || (((((0 <= a14 + 600000 && 301 <= a28) && a24 == 3) && (\exists v_~a28~0_1304 : int :: (a28 <= v_~a28~0_1304 * 9 / 10 % 299849 + 300149 && 0 <= 9 * v_~a28~0_1304) && 0 <= v_~a28~0_1304 * 9 / 10)) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || (((a24 == 3 && a26 + 554655 <= 0) && a21 <= 124) && a28 <= 599997)) || (((a26 <= 348799 && a28 <= 134) && a24 == 1) && a21 <= 124)) || (a24 == 1 && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0))) || (((a24 == 2 && a21 <= 124) && 0 < a14 + 182) && a26 <= 124)) || (((((((0 <= a14 + 600000 && 217 < a26) && (9 * a26 <= 10 * a28 + 2892136 || 37 < a28)) && a24 == 3) && a21 <= 124) && a28 <= 300) && (!(4 == input) || 37 < a28)) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0))) || ((((((9 * a26 <= 10 * a28 + 2892136 && 0 <= a14 + 600000) && a24 == 3) && a26 <= 215) && a21 <= 124) && a28 <= 111) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0))) || ((a24 == 2 && a28 <= 599997) && a21 <= 124)) || (((a28 <= 300 && a24 == 3) && a26 <= 124) && a21 <= 124)) || (a24 == 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || ((((((a24 == 3 && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && !(2 == input)) && 0 < a14 + 182) && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0))) || ((301 <= a28 && a24 == 1 && a26 <= 217) && a21 <= 124)) || (((a28 <= 300 && 124 < a26 && a24 == 1) && a21 <= 124) && (-a26 + 557256) / -20 <= 124)) || ((((a24 == 2 && a14 + 114 <= 0) && 0 < a14 + 182) && 222 <= a26) && a21 <= 124)) || (((9 * a26 <= 10 * a28 + 2892136 || 37 < a28) && (((((217 < a26 || 37 < a28) || !(2 == input)) && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124) && a28 <= 134)) || (((a24 == 2 && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || ((a24 == 1 && a28 <= 111) && a14 + 84 <= 0)) || (((((124 < a26 && 0 <= a14 + 600000) && a24 == 2) && a26 <= 217) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || ((124 < a26 && a24 == 1) && a14 + 84 <= 0)) || ((a26 <= 348799 && a28 <= 599997) && (124 < a26 && a24 == 1) && a21 <= 124)) || (((0 <= a14 + 600000 && a24 == 2) && (a26 + 68 <= 0 || a28 <= 134)) && a21 <= 124)) || ((((a24 == 3 && a14 + 114 <= 0) && a21 <= 124) && 0 < a14 + 182) && a26 <= 124)) || ((((((a26 + 68 <= 0 || a28 <= 134) && a24 == 3) && a21 <= 124) && a28 <= 599997) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a26 <= 124)) || ((((((9 * a26 <= 10 * a28 + 2892136 && a24 == 3) && a14 + 114 <= 0) && a26 <= 215) && a21 <= 124) && a28 <= 599997) && 0 < a14 + 182) [2019-11-16 00:19:13,949 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((a24 == 1 && a26 <= 217) && 0 < a14 + 114) || (((((0 <= a14 + 600000 && 301 <= a28) && a24 == 3) && (\exists v_~a28~0_1304 : int :: (a28 <= v_~a28~0_1304 * 9 / 10 % 299849 + 300149 && 0 <= 9 * v_~a28~0_1304) && 0 <= v_~a28~0_1304 * 9 / 10)) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || (((a24 == 3 && a26 + 554655 <= 0) && a21 <= 124) && a28 <= 599997)) || (((a26 <= 348799 && a28 <= 134) && a24 == 1) && a21 <= 124)) || (a24 == 1 && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0))) || (((a24 == 2 && a21 <= 124) && 0 < a14 + 182) && a26 <= 124)) || (((((((0 <= a14 + 600000 && 217 < a26) && (9 * a26 <= 10 * a28 + 2892136 || 37 < a28)) && a24 == 3) && a21 <= 124) && a28 <= 300) && (!(4 == input) || 37 < a28)) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0))) || ((((((9 * a26 <= 10 * a28 + 2892136 && 0 <= a14 + 600000) && a24 == 3) && a26 <= 215) && a21 <= 124) && a28 <= 111) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0))) || ((a24 == 2 && a28 <= 599997) && a21 <= 124)) || (((a28 <= 300 && a24 == 3) && a26 <= 124) && a21 <= 124)) || (a24 == 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || ((((((a24 == 3 && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && !(2 == input)) && 0 < a14 + 182) && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0))) || ((301 <= a28 && a24 == 1 && a26 <= 217) && a21 <= 124)) || (((a28 <= 300 && 124 < a26 && a24 == 1) && a21 <= 124) && (-a26 + 557256) / -20 <= 124)) || ((((a24 == 2 && a14 + 114 <= 0) && 0 < a14 + 182) && 222 <= a26) && a21 <= 124)) || (((9 * a26 <= 10 * a28 + 2892136 || 37 < a28) && (((((217 < a26 || 37 < a28) || !(2 == input)) && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124) && a28 <= 134)) || (((a24 == 2 && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || ((a24 == 1 && a28 <= 111) && a14 + 84 <= 0)) || (((((124 < a26 && 0 <= a14 + 600000) && a24 == 2) && a26 <= 217) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || ((124 < a26 && a24 == 1) && a14 + 84 <= 0)) || ((a26 <= 348799 && a28 <= 599997) && (124 < a26 && a24 == 1) && a21 <= 124)) || (((0 <= a14 + 600000 && a24 == 2) && (a26 + 68 <= 0 || a28 <= 134)) && a21 <= 124)) || ((((a24 == 3 && a14 + 114 <= 0) && a21 <= 124) && 0 < a14 + 182) && a26 <= 124)) || ((((((a26 + 68 <= 0 || a28 <= 134) && a24 == 3) && a21 <= 124) && a28 <= 599997) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a26 <= 124)) || ((((((9 * a26 <= 10 * a28 + 2892136 && a24 == 3) && a14 + 114 <= 0) && a26 <= 215) && a21 <= 124) && a28 <= 599997) && 0 < a14 + 182) [2019-11-16 00:19:13,960 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((a24 == 1 && a26 <= 217) && 0 < a14 + 114) || (((((0 <= a14 + 600000 && 301 <= a28) && a24 == 3) && (\exists v_~a28~0_1304 : int :: (a28 <= v_~a28~0_1304 * 9 / 10 % 299849 + 300149 && 0 <= 9 * v_~a28~0_1304) && 0 <= v_~a28~0_1304 * 9 / 10)) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || (((a24 == 3 && a26 + 554655 <= 0) && a21 <= 124) && a28 <= 599997)) || ((a24 == 2 && a28 <= 599997) && a21 <= 124)) || (((a26 <= 348799 && a28 <= 134) && a24 == 1) && a21 <= 124)) || (a24 == 1 && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0))) || (((a24 == 2 && a21 <= 124) && 0 < a14 + 182) && a26 <= 124)) || ((a26 <= 348799 && (124 < a26 && a24 == 1) && a21 <= 124) && a28 <= 599997)) || (((((((0 <= a14 + 600000 && 217 < a26) && (9 * a26 <= 10 * a28 + 2892136 || 37 < a28)) && a24 == 3) && a21 <= 124) && a28 <= 300) && (!(4 == input) || 37 < a28)) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0))) || ((((((9 * a26 <= 10 * a28 + 2892136 && 0 <= a14 + 600000) && a24 == 3) && a26 <= 215) && a21 <= 124) && a28 <= 111) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0))) || (((a28 <= 300 && a24 == 3) && a26 <= 124) && a21 <= 124)) || (a24 == 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || (((((((\exists v_prenex_7 : int :: (0 <= 9 * v_prenex_7 && a28 + 299969 <= v_prenex_7 * 9 / 10 % 299849) && 0 <= v_prenex_7 * 9 / 10) && a24 == 3) && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && !(2 == input)) && 0 < a14 + 182)) || ((301 <= a28 && a24 == 1 && a14 + 84 <= 0) && a21 <= 124)) || (((a28 <= 300 && 124 < a26 && a24 == 1) && a21 <= 124) && (-a26 + 557256) / -20 <= 124)) || ((((a24 == 2 && a14 + 114 <= 0) && 0 < a14 + 182) && 222 <= a26) && a21 <= 124)) || (((9 * a26 <= 10 * a28 + 2892136 || 37 < a28) && (((((217 < a26 || 37 < a28) || !(2 == input)) && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124) && a28 <= 134)) || (((a24 == 2 && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || ((a24 == 1 && a28 <= 111) && a14 + 84 <= 0)) || (((((124 < a26 && 0 <= a14 + 600000) && a24 == 2) && a26 <= 217) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || ((124 < a26 && a24 == 1) && a14 + 84 <= 0)) || (((0 <= a14 + 600000 && a24 == 2) && (a26 + 68 <= 0 || a28 <= 134)) && a21 <= 124)) || ((((a24 == 3 && a14 + 114 <= 0) && a21 <= 124) && 0 < a14 + 182) && a26 <= 124)) || ((((((a26 + 68 <= 0 || a28 <= 134) && a24 == 3) && a21 <= 124) && a28 <= 599997) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a26 <= 124)) || ((((((9 * a26 <= 10 * a28 + 2892136 && a24 == 3) && a14 + 114 <= 0) && a26 <= 215) && a21 <= 124) && a28 <= 599997) && 0 < a14 + 182) [2019-11-16 00:19:14,189 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8f755dc4-a73d-467e-870f-32085bb66929/bin/uautomizer/witness.graphml [2019-11-16 00:19:14,189 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:19:14,190 INFO L168 Benchmark]: Toolchain (without parser) took 731713.34 ms. Allocated memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: 4.5 GB). Free memory was 934.0 MB in the beginning and 4.6 GB in the end (delta: -3.7 GB). Peak memory consumption was 821.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:14,191 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:19:14,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1616.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 934.0 MB in the beginning and 1.0 GB in the end (delta: -85.4 MB). Peak memory consumption was 75.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:14,191 INFO L168 Benchmark]: Boogie Procedure Inliner took 368.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 954.5 MB in the end (delta: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:14,191 INFO L168 Benchmark]: Boogie Preprocessor took 337.00 ms. Allocated memory is still 1.2 GB. Free memory was 954.5 MB in the beginning and 922.3 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:14,192 INFO L168 Benchmark]: RCFGBuilder took 5081.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 107.5 MB). Free memory was 922.3 MB in the beginning and 1.0 GB in the end (delta: -102.6 MB). Peak memory consumption was 110.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:14,192 INFO L168 Benchmark]: TraceAbstraction took 723982.06 ms. Allocated memory was 1.3 GB in the beginning and 5.5 GB in the end (delta: 4.2 GB). Free memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-11-16 00:19:14,193 INFO L168 Benchmark]: Witness Printer took 323.39 ms. Allocated memory is still 5.5 GB. Free memory was 4.7 GB in the beginning and 4.6 GB in the end (delta: 98.0 MB). Peak memory consumption was 98.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:19:14,195 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1616.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 934.0 MB in the beginning and 1.0 GB in the end (delta: -85.4 MB). Peak memory consumption was 75.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 368.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 954.5 MB in the end (delta: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 337.00 ms. Allocated memory is still 1.2 GB. Free memory was 954.5 MB in the beginning and 922.3 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5081.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 107.5 MB). Free memory was 922.3 MB in the beginning and 1.0 GB in the end (delta: -102.6 MB). Peak memory consumption was 110.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 723982.06 ms. Allocated memory was 1.3 GB in the beginning and 5.5 GB in the end (delta: 4.2 GB). Free memory was 1.0 GB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 323.39 ms. Allocated memory is still 5.5 GB. Free memory was 4.7 GB in the beginning and 4.6 GB in the end (delta: 98.0 MB). Peak memory consumption was 98.0 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_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 185]: 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: 2574]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2580]: Loop Invariant [2019-11-16 00:19:14,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:14,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:14,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:14,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,210 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:14,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:14,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:14,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,215 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,215 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,215 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,216 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((a24 == 1 && a26 <= 217) && 0 < a14 + 114) || (((((0 <= a14 + 600000 && 301 <= a28) && a24 == 3) && (\exists v_~a28~0_1304 : int :: (a28 <= v_~a28~0_1304 * 9 / 10 % 299849 + 300149 && 0 <= 9 * v_~a28~0_1304) && 0 <= v_~a28~0_1304 * 9 / 10)) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || (((a24 == 3 && a26 + 554655 <= 0) && a21 <= 124) && a28 <= 599997)) || (((a26 <= 348799 && a28 <= 134) && a24 == 1) && a21 <= 124)) || (a24 == 1 && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0))) || (((a24 == 2 && a21 <= 124) && 0 < a14 + 182) && a26 <= 124)) || (((((((0 <= a14 + 600000 && 217 < a26) && (9 * a26 <= 10 * a28 + 2892136 || 37 < a28)) && a24 == 3) && a21 <= 124) && a28 <= 300) && (!(4 == input) || 37 < a28)) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0))) || ((((((9 * a26 <= 10 * a28 + 2892136 && 0 <= a14 + 600000) && a24 == 3) && a26 <= 215) && a21 <= 124) && a28 <= 111) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0))) || ((a24 == 2 && a28 <= 599997) && a21 <= 124)) || (((a28 <= 300 && a24 == 3) && a26 <= 124) && a21 <= 124)) || (a24 == 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || ((((((a24 == 3 && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && !(2 == input)) && 0 < a14 + 182) && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0))) || ((301 <= a28 && a24 == 1 && a26 <= 217) && a21 <= 124)) || (((a28 <= 300 && 124 < a26 && a24 == 1) && a21 <= 124) && (-a26 + 557256) / -20 <= 124)) || ((((a24 == 2 && a14 + 114 <= 0) && 0 < a14 + 182) && 222 <= a26) && a21 <= 124)) || (((9 * a26 <= 10 * a28 + 2892136 || 37 < a28) && (((((217 < a26 || 37 < a28) || !(2 == input)) && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124) && a28 <= 134)) || (((a24 == 2 && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || ((a24 == 1 && a28 <= 111) && a14 + 84 <= 0)) || (((((124 < a26 && 0 <= a14 + 600000) && a24 == 2) && a26 <= 217) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || ((124 < a26 && a24 == 1) && a14 + 84 <= 0)) || ((a26 <= 348799 && a28 <= 599997) && (124 < a26 && a24 == 1) && a21 <= 124)) || (((0 <= a14 + 600000 && a24 == 2) && (a26 + 68 <= 0 || a28 <= 134)) && a21 <= 124)) || ((((a24 == 3 && a14 + 114 <= 0) && a21 <= 124) && 0 < a14 + 182) && a26 <= 124)) || ((((((a26 + 68 <= 0 || a28 <= 134) && a24 == 3) && a21 <= 124) && a28 <= 599997) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a26 <= 124)) || ((((((9 * a26 <= 10 * a28 + 2892136 && a24 == 3) && a14 + 114 <= 0) && a26 <= 215) && a21 <= 124) && a28 <= 599997) && 0 < a14 + 182) - InvariantResult [Line: 1646]: Loop Invariant [2019-11-16 00:19:14,217 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:14,217 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:14,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:14,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-11-16 00:19:14,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-11-16 00:19:14,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-11-16 00:19:14,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:14,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:14,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:14,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-11-16 00:19:14,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-11-16 00:19:14,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((a24 == 1 && a26 <= 217) && 0 < a14 + 114) || (((((0 <= a14 + 600000 && 301 <= a28) && a24 == 3) && (\exists v_~a28~0_1304 : int :: (a28 <= v_~a28~0_1304 * 9 / 10 % 299849 + 300149 && 0 <= 9 * v_~a28~0_1304) && 0 <= v_~a28~0_1304 * 9 / 10)) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || (((a24 == 3 && a26 + 554655 <= 0) && a21 <= 124) && a28 <= 599997)) || ((a24 == 2 && a28 <= 599997) && a21 <= 124)) || (((a26 <= 348799 && a28 <= 134) && a24 == 1) && a21 <= 124)) || (a24 == 1 && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0))) || (((a24 == 2 && a21 <= 124) && 0 < a14 + 182) && a26 <= 124)) || ((a26 <= 348799 && (124 < a26 && a24 == 1) && a21 <= 124) && a28 <= 599997)) || (((((((0 <= a14 + 600000 && 217 < a26) && (9 * a26 <= 10 * a28 + 2892136 || 37 < a28)) && a24 == 3) && a21 <= 124) && a28 <= 300) && (!(4 == input) || 37 < a28)) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0))) || ((((((9 * a26 <= 10 * a28 + 2892136 && 0 <= a14 + 600000) && a24 == 3) && a26 <= 215) && a21 <= 124) && a28 <= 111) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0))) || (((a28 <= 300 && a24 == 3) && a26 <= 124) && a21 <= 124)) || (a24 == 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || (((((((\exists v_prenex_7 : int :: (0 <= 9 * v_prenex_7 && a28 + 299969 <= v_prenex_7 * 9 / 10 % 299849) && 0 <= v_prenex_7 * 9 / 10) && a24 == 3) && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && !(2 == input)) && 0 < a14 + 182)) || ((301 <= a28 && a24 == 1 && a14 + 84 <= 0) && a21 <= 124)) || (((a28 <= 300 && 124 < a26 && a24 == 1) && a21 <= 124) && (-a26 + 557256) / -20 <= 124)) || ((((a24 == 2 && a14 + 114 <= 0) && 0 < a14 + 182) && 222 <= a26) && a21 <= 124)) || (((9 * a26 <= 10 * a28 + 2892136 || 37 < a28) && (((((217 < a26 || 37 < a28) || !(2 == input)) && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124) && a28 <= 134)) || (((a24 == 2 && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || ((a24 == 1 && a28 <= 111) && a14 + 84 <= 0)) || (((((124 < a26 && 0 <= a14 + 600000) && a24 == 2) && a26 <= 217) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || ((124 < a26 && a24 == 1) && a14 + 84 <= 0)) || (((0 <= a14 + 600000 && a24 == 2) && (a26 + 68 <= 0 || a28 <= 134)) && a21 <= 124)) || ((((a24 == 3 && a14 + 114 <= 0) && a21 <= 124) && 0 < a14 + 182) && a26 <= 124)) || ((((((a26 + 68 <= 0 || a28 <= 134) && a24 == 3) && a21 <= 124) && a28 <= 599997) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a26 <= 124)) || ((((((9 * a26 <= 10 * a28 + 2892136 && a24 == 3) && a14 + 114 <= 0) && a26 <= 215) && a21 <= 124) && a28 <= 599997) && 0 < a14 + 182) - InvariantResult [Line: 24]: Loop Invariant [2019-11-16 00:19:14,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:14,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:14,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:14,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,228 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,228 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,228 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,229 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:14,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:14,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1304,QUANTIFIED] [2019-11-16 00:19:14,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,233 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] [2019-11-16 00:19:14,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1300,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((a24 == 1 && a26 <= 217) && 0 < a14 + 114) || (((((0 <= a14 + 600000 && 301 <= a28) && a24 == 3) && (\exists v_~a28~0_1304 : int :: (a28 <= v_~a28~0_1304 * 9 / 10 % 299849 + 300149 && 0 <= 9 * v_~a28~0_1304) && 0 <= v_~a28~0_1304 * 9 / 10)) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || (((a24 == 3 && a26 + 554655 <= 0) && a21 <= 124) && a28 <= 599997)) || (((a26 <= 348799 && a28 <= 134) && a24 == 1) && a21 <= 124)) || (a24 == 1 && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0))) || (((a24 == 2 && a21 <= 124) && 0 < a14 + 182) && a26 <= 124)) || (((((((0 <= a14 + 600000 && 217 < a26) && (9 * a26 <= 10 * a28 + 2892136 || 37 < a28)) && a24 == 3) && a21 <= 124) && a28 <= 300) && (!(4 == input) || 37 < a28)) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0))) || ((((((9 * a26 <= 10 * a28 + 2892136 && 0 <= a14 + 600000) && a24 == 3) && a26 <= 215) && a21 <= 124) && a28 <= 111) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0))) || ((a24 == 2 && a28 <= 599997) && a21 <= 124)) || (((a28 <= 300 && a24 == 3) && a26 <= 124) && a21 <= 124)) || (a24 == 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || ((((((a24 == 3 && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && !(2 == input)) && 0 < a14 + 182) && (\exists v_~a28~0_1300 : int :: (((a28 <= ((v_~a28~0_1300 + -600036) / 5 + 1) / 5 && v_~a28~0_1300 <= 111) && !(0 == (v_~a28~0_1300 + 4) % 5)) && v_~a28~0_1300 < 600036) && ((v_~a28~0_1300 + -600036) / 5 + 1) % 5 == 0))) || ((301 <= a28 && a24 == 1 && a26 <= 217) && a21 <= 124)) || (((a28 <= 300 && 124 < a26 && a24 == 1) && a21 <= 124) && (-a26 + 557256) / -20 <= 124)) || ((((a24 == 2 && a14 + 114 <= 0) && 0 < a14 + 182) && 222 <= a26) && a21 <= 124)) || (((9 * a26 <= 10 * a28 + 2892136 || 37 < a28) && (((((217 < a26 || 37 < a28) || !(2 == input)) && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124) && a28 <= 134)) || (((a24 == 2 && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || ((a24 == 1 && a28 <= 111) && a14 + 84 <= 0)) || (((((124 < a26 && 0 <= a14 + 600000) && a24 == 2) && a26 <= 217) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a21 <= 124)) || ((124 < a26 && a24 == 1) && a14 + 84 <= 0)) || ((a26 <= 348799 && a28 <= 599997) && (124 < a26 && a24 == 1) && a21 <= 124)) || (((0 <= a14 + 600000 && a24 == 2) && (a26 + 68 <= 0 || a28 <= 134)) && a21 <= 124)) || ((((a24 == 3 && a14 + 114 <= 0) && a21 <= 124) && 0 < a14 + 182) && a26 <= 124)) || ((((((a26 + 68 <= 0 || a28 <= 134) && a24 == 3) && a21 <= 124) && a28 <= 599997) && (a26 + a14 + 1052964 <= 0 || a14 + 182 <= 0)) && a26 <= 124)) || ((((((9 * a26 <= 10 * a28 + 2892136 && a24 == 3) && a14 + 114 <= 0) && a26 <= 215) && a21 <= 124) && a28 <= 599997) && 0 < a14 + 182) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 590 locations, 1 error locations. Result: SAFE, OverallTime: 723.8s, OverallIterations: 21, TraceHistogramMax: 9, AutomataDifference: 487.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 153.7s, HoareTripleCheckerStatistics: 5709 SDtfs, 50854 SDslu, 2775 SDs, 0 SdLazy, 111156 SolverSat, 17058 SolverUnsat, 401 SolverUnknown, 0 SolverNotchecked, 414.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7787 GetRequests, 7554 SyntacticMatches, 20 SemanticMatches, 213 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1982 ImplicationChecksByTransitivity, 45.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125079occurred 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: 13.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 215759 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 972 NumberOfFragments, 1913 HoareAnnotationTreeSize, 4 FomulaSimplifications, 24792396 FormulaSimplificationTreeSizeReduction, 26.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 9477957 FormulaSimplificationTreeSizeReductionInter, 127.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 45.1s InterpolantComputationTime, 23645 NumberOfCodeBlocks, 23645 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 23615 ConstructedInterpolants, 1165 QuantifiedInterpolants, 223387414 SizeOfPredicates, 12 NumberOfNonLiveVariables, 8942 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 30 InterpolantComputations, 16 PerfectInterpolantSequences, 35438/41528 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! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...