./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem17_label41.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem17_label41.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/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 629a9f5a301d91765ef653fcbff1dcb4386e9722 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 03:46:35,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:46:35,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:46:35,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:46:35,017 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:46:35,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:46:35,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:46:35,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:46:35,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:46:35,035 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:46:35,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:46:35,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:46:35,038 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:46:35,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:46:35,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:46:35,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:46:35,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:46:35,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:46:35,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:46:35,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:46:35,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:46:35,054 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:46:35,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:46:35,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:46:35,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:46:35,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:46:35,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:46:35,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:46:35,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:46:35,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:46:35,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:46:35,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:46:35,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:46:35,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:46:35,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:46:35,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:46:35,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:46:35,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:46:35,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:46:35,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:46:35,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:46:35,070 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 03:46:35,094 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:46:35,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:46:35,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:46:35,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:46:35,096 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:46:35,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:46:35,096 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:46:35,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:46:35,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:46:35,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:46:35,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:46:35,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:46:35,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:46:35,098 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:46:35,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:46:35,098 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:46:35,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:46:35,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:46:35,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:46:35,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:46:35,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:46:35,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:46:35,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:46:35,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:46:35,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:46:35,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:46:35,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:46:35,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:46:35,100 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_c21a4676-8bcf-4f03-9207-4dbcf53cb536/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 -> 629a9f5a301d91765ef653fcbff1dcb4386e9722 [2019-11-20 03:46:35,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:46:35,253 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:46:35,256 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:46:35,258 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:46:35,258 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:46:35,258 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem17_label41.c [2019-11-20 03:46:35,307 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/data/3fe2b6d62/88f8d3ca08cb4db4bbc5d15577f56c29/FLAG9ccac3329 [2019-11-20 03:46:35,940 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:46:35,941 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/sv-benchmarks/c/eca-rers2012/Problem17_label41.c [2019-11-20 03:46:35,961 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/data/3fe2b6d62/88f8d3ca08cb4db4bbc5d15577f56c29/FLAG9ccac3329 [2019-11-20 03:46:36,329 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/data/3fe2b6d62/88f8d3ca08cb4db4bbc5d15577f56c29 [2019-11-20 03:46:36,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:46:36,332 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:46:36,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:46:36,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:46:36,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:46:36,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:46:36" (1/1) ... [2019-11-20 03:46:36,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d55c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:46:36, skipping insertion in model container [2019-11-20 03:46:36,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:46:36" (1/1) ... [2019-11-20 03:46:36,344 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:46:36,436 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:46:37,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:46:37,457 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:46:37,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:46:37,876 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:46:37,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:46:37 WrapperNode [2019-11-20 03:46:37,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:46:37,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:46:37,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:46:37,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:46:37,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:46:37" (1/1) ... [2019-11-20 03:46:37,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:46:37" (1/1) ... [2019-11-20 03:46:38,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:46:38,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:46:38,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:46:38,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:46:38,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:46:37" (1/1) ... [2019-11-20 03:46:38,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:46:37" (1/1) ... [2019-11-20 03:46:38,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:46:37" (1/1) ... [2019-11-20 03:46:38,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:46:37" (1/1) ... [2019-11-20 03:46:38,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:46:37" (1/1) ... [2019-11-20 03:46:38,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:46:37" (1/1) ... [2019-11-20 03:46:38,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:46:37" (1/1) ... [2019-11-20 03:46:38,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:46:38,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:46:38,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:46:38,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:46:38,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:46:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:46:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:46:38,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:46:43,074 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:46:43,074 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-20 03:46:43,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:46:43 BoogieIcfgContainer [2019-11-20 03:46:43,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:46:43,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:46:43,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:46:43,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:46:43,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:46:36" (1/3) ... [2019-11-20 03:46:43,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cfd15df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:46:43, skipping insertion in model container [2019-11-20 03:46:43,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:46:37" (2/3) ... [2019-11-20 03:46:43,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cfd15df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:46:43, skipping insertion in model container [2019-11-20 03:46:43,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:46:43" (3/3) ... [2019-11-20 03:46:43,086 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label41.c [2019-11-20 03:46:43,094 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:46:43,102 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:46:43,111 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:46:43,152 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:46:43,152 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:46:43,153 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:46:43,153 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:46:43,153 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:46:43,153 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:46:43,153 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:46:43,155 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:46:43,186 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states. [2019-11-20 03:46:43,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 03:46:43,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:46:43,196 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:46:43,196 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:46:43,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:46:43,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1089129850, now seen corresponding path program 1 times [2019-11-20 03:46:43,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:46:43,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131007628] [2019-11-20 03:46:43,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:46:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:46:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:46:43,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131007628] [2019-11-20 03:46:43,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:46:43,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:46:43,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804924985] [2019-11-20 03:46:43,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:46:43,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:46:43,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:46:43,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:46:43,439 INFO L87 Difference]: Start difference. First operand 590 states. Second operand 4 states. [2019-11-20 03:46:48,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:46:48,787 INFO L93 Difference]: Finished difference Result 2122 states and 3952 transitions. [2019-11-20 03:46:48,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:46:48,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-20 03:46:48,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:46:48,813 INFO L225 Difference]: With dead ends: 2122 [2019-11-20 03:46:48,813 INFO L226 Difference]: Without dead ends: 1450 [2019-11-20 03:46:48,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:46:48,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-11-20 03:46:48,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 986. [2019-11-20 03:46:48,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2019-11-20 03:46:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1673 transitions. [2019-11-20 03:46:48,925 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1673 transitions. Word has length 34 [2019-11-20 03:46:48,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:46:48,925 INFO L462 AbstractCegarLoop]: Abstraction has 986 states and 1673 transitions. [2019-11-20 03:46:48,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:46:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1673 transitions. [2019-11-20 03:46:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 03:46:48,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:46:48,930 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:46:48,931 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:46:48,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:46:48,931 INFO L82 PathProgramCache]: Analyzing trace with hash -279207896, now seen corresponding path program 1 times [2019-11-20 03:46:48,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:46:48,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670660822] [2019-11-20 03:46:48,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:46:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:46:49,069 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:46:49,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670660822] [2019-11-20 03:46:49,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:46:49,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:46:49,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360520028] [2019-11-20 03:46:49,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:46:49,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:46:49,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:46:49,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:46:49,072 INFO L87 Difference]: Start difference. First operand 986 states and 1673 transitions. Second operand 4 states. [2019-11-20 03:46:53,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:46:53,818 INFO L93 Difference]: Finished difference Result 3682 states and 6330 transitions. [2019-11-20 03:46:53,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:46:53,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-20 03:46:53,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:46:53,839 INFO L225 Difference]: With dead ends: 3682 [2019-11-20 03:46:53,840 INFO L226 Difference]: Without dead ends: 2698 [2019-11-20 03:46:53,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:46:53,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2019-11-20 03:46:53,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2698. [2019-11-20 03:46:53,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2698 states. [2019-11-20 03:46:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 3704 transitions. [2019-11-20 03:46:53,905 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 3704 transitions. Word has length 105 [2019-11-20 03:46:53,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:46:53,906 INFO L462 AbstractCegarLoop]: Abstraction has 2698 states and 3704 transitions. [2019-11-20 03:46:53,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:46:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 3704 transitions. [2019-11-20 03:46:53,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-20 03:46:53,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:46:53,913 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:46:53,913 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:46:53,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:46:53,914 INFO L82 PathProgramCache]: Analyzing trace with hash -449786728, now seen corresponding path program 1 times [2019-11-20 03:46:53,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:46:53,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636751160] [2019-11-20 03:46:53,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:46:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:46:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-20 03:46:54,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636751160] [2019-11-20 03:46:54,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:46:54,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:46:54,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471981556] [2019-11-20 03:46:54,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:46:54,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:46:54,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:46:54,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:46:54,103 INFO L87 Difference]: Start difference. First operand 2698 states and 3704 transitions. Second operand 3 states. [2019-11-20 03:46:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:46:58,774 INFO L93 Difference]: Finished difference Result 7942 states and 10911 transitions. [2019-11-20 03:46:58,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:46:58,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-20 03:46:58,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:46:58,809 INFO L225 Difference]: With dead ends: 7942 [2019-11-20 03:46:58,810 INFO L226 Difference]: Without dead ends: 5246 [2019-11-20 03:46:58,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:46:58,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2019-11-20 03:46:58,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 4820. [2019-11-20 03:46:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4820 states. [2019-11-20 03:46:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4820 states to 4820 states and 6035 transitions. [2019-11-20 03:46:58,911 INFO L78 Accepts]: Start accepts. Automaton has 4820 states and 6035 transitions. Word has length 188 [2019-11-20 03:46:58,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:46:58,913 INFO L462 AbstractCegarLoop]: Abstraction has 4820 states and 6035 transitions. [2019-11-20 03:46:58,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:46:58,914 INFO L276 IsEmpty]: Start isEmpty. Operand 4820 states and 6035 transitions. [2019-11-20 03:46:58,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-20 03:46:58,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:46:58,929 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:46:58,929 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:46:58,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:46:58,929 INFO L82 PathProgramCache]: Analyzing trace with hash -2099311771, now seen corresponding path program 1 times [2019-11-20 03:46:58,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:46:58,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476383701] [2019-11-20 03:46:58,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:46:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:46:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:46:59,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476383701] [2019-11-20 03:46:59,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:46:59,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:46:59,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800262673] [2019-11-20 03:46:59,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:46:59,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:46:59,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:46:59,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:46:59,181 INFO L87 Difference]: Start difference. First operand 4820 states and 6035 transitions. Second operand 3 states. [2019-11-20 03:47:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:47:01,099 INFO L93 Difference]: Finished difference Result 9637 states and 12067 transitions. [2019-11-20 03:47:01,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:47:01,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-11-20 03:47:01,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:47:01,125 INFO L225 Difference]: With dead ends: 9637 [2019-11-20 03:47:01,125 INFO L226 Difference]: Without dead ends: 4819 [2019-11-20 03:47:01,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:47:01,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4819 states. [2019-11-20 03:47:01,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4819 to 4819. [2019-11-20 03:47:01,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4819 states. [2019-11-20 03:47:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4819 states to 4819 states and 5684 transitions. [2019-11-20 03:47:01,236 INFO L78 Accepts]: Start accepts. Automaton has 4819 states and 5684 transitions. Word has length 195 [2019-11-20 03:47:01,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:47:01,237 INFO L462 AbstractCegarLoop]: Abstraction has 4819 states and 5684 transitions. [2019-11-20 03:47:01,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:47:01,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4819 states and 5684 transitions. [2019-11-20 03:47:01,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-11-20 03:47:01,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:47:01,242 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:47:01,242 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:47:01,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:47:01,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1367873502, now seen corresponding path program 1 times [2019-11-20 03:47:01,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:47:01,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360836701] [2019-11-20 03:47:01,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:47:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-20 03:47:01,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360836701] [2019-11-20 03:47:01,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:47:01,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:47:01,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837288707] [2019-11-20 03:47:01,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:47:01,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:47:01,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:47:01,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:47:01,490 INFO L87 Difference]: Start difference. First operand 4819 states and 5684 transitions. Second operand 4 states. [2019-11-20 03:47:06,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:47:06,286 INFO L93 Difference]: Finished difference Result 12637 states and 15016 transitions. [2019-11-20 03:47:06,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:47:06,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-11-20 03:47:06,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:47:06,323 INFO L225 Difference]: With dead ends: 12637 [2019-11-20 03:47:06,323 INFO L226 Difference]: Without dead ends: 7820 [2019-11-20 03:47:06,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:47:06,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7820 states. [2019-11-20 03:47:06,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7820 to 6102. [2019-11-20 03:47:06,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6102 states. [2019-11-20 03:47:06,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6102 states to 6102 states and 7185 transitions. [2019-11-20 03:47:06,444 INFO L78 Accepts]: Start accepts. Automaton has 6102 states and 7185 transitions. Word has length 254 [2019-11-20 03:47:06,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:47:06,444 INFO L462 AbstractCegarLoop]: Abstraction has 6102 states and 7185 transitions. [2019-11-20 03:47:06,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:47:06,445 INFO L276 IsEmpty]: Start isEmpty. Operand 6102 states and 7185 transitions. [2019-11-20 03:47:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-11-20 03:47:06,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:47:06,449 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:47:06,449 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:47:06,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:47:06,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2020673444, now seen corresponding path program 1 times [2019-11-20 03:47:06,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:47:06,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19798963] [2019-11-20 03:47:06,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:47:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:06,995 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 0 proven. 304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:47:06,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19798963] [2019-11-20 03:47:06,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248461001] [2019-11-20 03:47:06,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:47:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:07,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:47:07,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:47:07,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:47:07,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:47:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 202 proven. 70 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 03:47:07,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:47:07,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3] total 10 [2019-11-20 03:47:07,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17752397] [2019-11-20 03:47:07,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 03:47:07,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:47:07,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 03:47:07,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-20 03:47:07,337 INFO L87 Difference]: Start difference. First operand 6102 states and 7185 transitions. Second operand 11 states. [2019-11-20 03:47:28,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:47:28,286 INFO L93 Difference]: Finished difference Result 47929 states and 57900 transitions. [2019-11-20 03:47:28,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 03:47:28,287 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 258 [2019-11-20 03:47:28,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:47:28,360 INFO L225 Difference]: With dead ends: 47929 [2019-11-20 03:47:28,360 INFO L226 Difference]: Without dead ends: 31602 [2019-11-20 03:47:28,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2019-11-20 03:47:28,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31602 states. [2019-11-20 03:47:28,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31602 to 25637. [2019-11-20 03:47:28,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25637 states. [2019-11-20 03:47:28,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25637 states to 25637 states and 28133 transitions. [2019-11-20 03:47:28,765 INFO L78 Accepts]: Start accepts. Automaton has 25637 states and 28133 transitions. Word has length 258 [2019-11-20 03:47:28,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:47:28,766 INFO L462 AbstractCegarLoop]: Abstraction has 25637 states and 28133 transitions. [2019-11-20 03:47:28,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 03:47:28,767 INFO L276 IsEmpty]: Start isEmpty. Operand 25637 states and 28133 transitions. [2019-11-20 03:47:28,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-11-20 03:47:28,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:47:28,779 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 03:47:28,984 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:47:28,984 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:47:28,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:47:28,984 INFO L82 PathProgramCache]: Analyzing trace with hash -356377686, now seen corresponding path program 1 times [2019-11-20 03:47:28,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:47:28,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202408347] [2019-11-20 03:47:28,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:47:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-20 03:47:29,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202408347] [2019-11-20 03:47:29,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:47:29,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:47:29,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933323073] [2019-11-20 03:47:29,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:47:29,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:47:29,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:47:29,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:47:29,353 INFO L87 Difference]: Start difference. First operand 25637 states and 28133 transitions. Second operand 3 states. [2019-11-20 03:47:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:47:31,190 INFO L93 Difference]: Finished difference Result 53397 states and 58615 transitions. [2019-11-20 03:47:31,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:47:31,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 405 [2019-11-20 03:47:31,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:47:31,233 INFO L225 Difference]: With dead ends: 53397 [2019-11-20 03:47:31,233 INFO L226 Difference]: Without dead ends: 28187 [2019-11-20 03:47:31,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:47:31,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28187 states. [2019-11-20 03:47:31,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28187 to 26062. [2019-11-20 03:47:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26062 states. [2019-11-20 03:47:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26062 states to 26062 states and 28641 transitions. [2019-11-20 03:47:31,565 INFO L78 Accepts]: Start accepts. Automaton has 26062 states and 28641 transitions. Word has length 405 [2019-11-20 03:47:31,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:47:31,566 INFO L462 AbstractCegarLoop]: Abstraction has 26062 states and 28641 transitions. [2019-11-20 03:47:31,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:47:31,567 INFO L276 IsEmpty]: Start isEmpty. Operand 26062 states and 28641 transitions. [2019-11-20 03:47:31,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-11-20 03:47:31,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:47:31,582 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 03:47:31,582 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:47:31,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:47:31,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1820651612, now seen corresponding path program 1 times [2019-11-20 03:47:31,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:47:31,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603941352] [2019-11-20 03:47:31,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:47:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-20 03:47:32,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603941352] [2019-11-20 03:47:32,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:47:32,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:47:32,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14757690] [2019-11-20 03:47:32,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:47:32,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:47:32,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:47:32,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:47:32,092 INFO L87 Difference]: Start difference. First operand 26062 states and 28641 transitions. Second operand 3 states. [2019-11-20 03:47:36,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:47:36,214 INFO L93 Difference]: Finished difference Result 63175 states and 69454 transitions. [2019-11-20 03:47:36,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:47:36,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 420 [2019-11-20 03:47:36,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:47:36,285 INFO L225 Difference]: With dead ends: 63175 [2019-11-20 03:47:36,286 INFO L226 Difference]: Without dead ends: 37540 [2019-11-20 03:47:36,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:47:36,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37540 states. [2019-11-20 03:47:36,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37540 to 34985. [2019-11-20 03:47:36,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34985 states. [2019-11-20 03:47:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34985 states to 34985 states and 37773 transitions. [2019-11-20 03:47:36,641 INFO L78 Accepts]: Start accepts. Automaton has 34985 states and 37773 transitions. Word has length 420 [2019-11-20 03:47:36,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:47:36,642 INFO L462 AbstractCegarLoop]: Abstraction has 34985 states and 37773 transitions. [2019-11-20 03:47:36,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:47:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 34985 states and 37773 transitions. [2019-11-20 03:47:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-11-20 03:47:36,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:47:36,665 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:47:36,665 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:47:36,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:47:36,666 INFO L82 PathProgramCache]: Analyzing trace with hash -2018829380, now seen corresponding path program 1 times [2019-11-20 03:47:36,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:47:36,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559532298] [2019-11-20 03:47:36,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:47:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 305 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:47:37,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559532298] [2019-11-20 03:47:37,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35665618] [2019-11-20 03:47:37,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:47:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:37,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:47:37,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:47:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-11-20 03:47:37,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:47:37,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-11-20 03:47:37,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619588709] [2019-11-20 03:47:37,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:47:37,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:47:37,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:47:37,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-20 03:47:37,959 INFO L87 Difference]: Start difference. First operand 34985 states and 37773 transitions. Second operand 4 states. [2019-11-20 03:47:42,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:47:42,159 INFO L93 Difference]: Finished difference Result 92115 states and 99479 transitions. [2019-11-20 03:47:42,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:47:42,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 500 [2019-11-20 03:47:42,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:47:42,224 INFO L225 Difference]: With dead ends: 92115 [2019-11-20 03:47:42,225 INFO L226 Difference]: Without dead ends: 56282 [2019-11-20 03:47:42,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-20 03:47:42,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56282 states. [2019-11-20 03:47:42,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56282 to 46066. [2019-11-20 03:47:42,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46066 states. [2019-11-20 03:47:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46066 states to 46066 states and 49443 transitions. [2019-11-20 03:47:42,711 INFO L78 Accepts]: Start accepts. Automaton has 46066 states and 49443 transitions. Word has length 500 [2019-11-20 03:47:42,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:47:42,711 INFO L462 AbstractCegarLoop]: Abstraction has 46066 states and 49443 transitions. [2019-11-20 03:47:42,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:47:42,712 INFO L276 IsEmpty]: Start isEmpty. Operand 46066 states and 49443 transitions. [2019-11-20 03:47:42,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2019-11-20 03:47:42,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:47:42,741 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:47:42,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:47:42,945 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:47:42,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:47:42,945 INFO L82 PathProgramCache]: Analyzing trace with hash 153680514, now seen corresponding path program 1 times [2019-11-20 03:47:42,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:47:42,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780310546] [2019-11-20 03:47:42,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:47:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:43,322 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 521 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-20 03:47:43,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780310546] [2019-11-20 03:47:43,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:47:43,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:47:43,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605212477] [2019-11-20 03:47:43,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:47:43,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:47:43,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:47:43,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:47:43,325 INFO L87 Difference]: Start difference. First operand 46066 states and 49443 transitions. Second operand 4 states. [2019-11-20 03:47:47,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:47:47,281 INFO L93 Difference]: Finished difference Result 98958 states and 105970 transitions. [2019-11-20 03:47:47,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:47:47,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 503 [2019-11-20 03:47:47,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:47:47,321 INFO L225 Difference]: With dead ends: 98958 [2019-11-20 03:47:47,322 INFO L226 Difference]: Without dead ends: 53319 [2019-11-20 03:47:47,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:47:47,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53319 states. [2019-11-20 03:47:47,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53319 to 46066. [2019-11-20 03:47:47,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46066 states. [2019-11-20 03:47:47,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46066 states to 46066 states and 49424 transitions. [2019-11-20 03:47:47,725 INFO L78 Accepts]: Start accepts. Automaton has 46066 states and 49424 transitions. Word has length 503 [2019-11-20 03:47:47,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:47:47,726 INFO L462 AbstractCegarLoop]: Abstraction has 46066 states and 49424 transitions. [2019-11-20 03:47:47,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:47:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 46066 states and 49424 transitions. [2019-11-20 03:47:47,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-11-20 03:47:47,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:47:47,742 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:47:47,742 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:47:47,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:47:47,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1023396058, now seen corresponding path program 1 times [2019-11-20 03:47:47,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:47:47,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451509019] [2019-11-20 03:47:47,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:47:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 305 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:47:48,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451509019] [2019-11-20 03:47:48,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135794943] [2019-11-20 03:47:48,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:47:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:48,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:47:48,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:47:48,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:47:48,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:47:49,804 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-11-20 03:47:49,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:47:49,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-11-20 03:47:49,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919559613] [2019-11-20 03:47:49,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:47:49,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:47:49,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:47:49,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-20 03:47:49,807 INFO L87 Difference]: Start difference. First operand 46066 states and 49424 transitions. Second operand 4 states. [2019-11-20 03:47:55,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:47:55,056 INFO L93 Difference]: Finished difference Result 112574 states and 121075 transitions. [2019-11-20 03:47:55,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:47:55,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2019-11-20 03:47:55,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:47:55,119 INFO L225 Difference]: With dead ends: 112574 [2019-11-20 03:47:55,119 INFO L226 Difference]: Without dead ends: 65660 [2019-11-20 03:47:55,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-20 03:47:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65660 states. [2019-11-20 03:47:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65660 to 46066. [2019-11-20 03:47:55,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46066 states. [2019-11-20 03:47:55,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46066 states to 46066 states and 49428 transitions. [2019-11-20 03:47:55,552 INFO L78 Accepts]: Start accepts. Automaton has 46066 states and 49428 transitions. Word has length 505 [2019-11-20 03:47:55,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:47:55,553 INFO L462 AbstractCegarLoop]: Abstraction has 46066 states and 49428 transitions. [2019-11-20 03:47:55,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:47:55,553 INFO L276 IsEmpty]: Start isEmpty. Operand 46066 states and 49428 transitions. [2019-11-20 03:47:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2019-11-20 03:47:55,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:47:55,568 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:47:55,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:47:55,769 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:47:55,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:47:55,769 INFO L82 PathProgramCache]: Analyzing trace with hash -5548667, now seen corresponding path program 1 times [2019-11-20 03:47:55,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:47:55,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910515167] [2019-11-20 03:47:55,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:47:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 3 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:47:57,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910515167] [2019-11-20 03:47:57,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333818741] [2019-11-20 03:47:57,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:47:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:47:57,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:47:57,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:47:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 539 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-20 03:47:57,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:47:57,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2019-11-20 03:47:57,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304701534] [2019-11-20 03:47:57,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:47:57,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:47:57,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:47:57,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:47:57,887 INFO L87 Difference]: Start difference. First operand 46066 states and 49428 transitions. Second operand 3 states. [2019-11-20 03:48:00,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:48:00,217 INFO L93 Difference]: Finished difference Result 94264 states and 101130 transitions. [2019-11-20 03:48:00,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:48:00,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 558 [2019-11-20 03:48:00,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:48:00,259 INFO L225 Difference]: With dead ends: 94264 [2019-11-20 03:48:00,259 INFO L226 Difference]: Without dead ends: 48200 [2019-11-20 03:48:00,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:48:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48200 states. [2019-11-20 03:48:00,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48200 to 48189. [2019-11-20 03:48:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48189 states. [2019-11-20 03:48:00,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48189 states to 48189 states and 51635 transitions. [2019-11-20 03:48:00,623 INFO L78 Accepts]: Start accepts. Automaton has 48189 states and 51635 transitions. Word has length 558 [2019-11-20 03:48:00,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:48:00,624 INFO L462 AbstractCegarLoop]: Abstraction has 48189 states and 51635 transitions. [2019-11-20 03:48:00,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:48:00,624 INFO L276 IsEmpty]: Start isEmpty. Operand 48189 states and 51635 transitions. [2019-11-20 03:48:00,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2019-11-20 03:48:00,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:48:00,639 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:48:00,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:48:00,842 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:48:00,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:48:00,842 INFO L82 PathProgramCache]: Analyzing trace with hash 658202556, now seen corresponding path program 1 times [2019-11-20 03:48:00,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:48:00,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119802612] [2019-11-20 03:48:00,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:48:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-20 03:48:01,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119802612] [2019-11-20 03:48:01,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:48:01,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:48:01,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642074041] [2019-11-20 03:48:01,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:48:01,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:48:01,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:48:01,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:48:01,318 INFO L87 Difference]: Start difference. First operand 48189 states and 51635 transitions. Second operand 3 states. [2019-11-20 03:48:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:48:02,601 INFO L93 Difference]: Finished difference Result 94241 states and 100983 transitions. [2019-11-20 03:48:02,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:48:02,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 559 [2019-11-20 03:48:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:48:02,635 INFO L225 Difference]: With dead ends: 94241 [2019-11-20 03:48:02,635 INFO L226 Difference]: Without dead ends: 46053 [2019-11-20 03:48:02,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:48:02,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46053 states. [2019-11-20 03:48:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46053 to 46050. [2019-11-20 03:48:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46050 states. [2019-11-20 03:48:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46050 states to 46050 states and 49335 transitions. [2019-11-20 03:48:03,007 INFO L78 Accepts]: Start accepts. Automaton has 46050 states and 49335 transitions. Word has length 559 [2019-11-20 03:48:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:48:03,007 INFO L462 AbstractCegarLoop]: Abstraction has 46050 states and 49335 transitions. [2019-11-20 03:48:03,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:48:03,007 INFO L276 IsEmpty]: Start isEmpty. Operand 46050 states and 49335 transitions. [2019-11-20 03:48:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2019-11-20 03:48:03,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:48:03,017 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:48:03,017 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:48:03,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:48:03,018 INFO L82 PathProgramCache]: Analyzing trace with hash 258696126, now seen corresponding path program 1 times [2019-11-20 03:48:03,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:48:03,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081251249] [2019-11-20 03:48:03,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:48:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 309 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:48:04,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081251249] [2019-11-20 03:48:04,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138474740] [2019-11-20 03:48:04,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:48:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:04,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:48:04,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:48:04,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:04,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:48:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-11-20 03:48:05,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:48:05,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-11-20 03:48:05,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200642282] [2019-11-20 03:48:05,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:48:05,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:48:05,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:48:05,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-11-20 03:48:05,526 INFO L87 Difference]: Start difference. First operand 46050 states and 49335 transitions. Second operand 5 states. [2019-11-20 03:48:10,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:48:10,186 INFO L93 Difference]: Finished difference Result 108269 states and 115888 transitions. [2019-11-20 03:48:10,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:48:10,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 559 [2019-11-20 03:48:10,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:48:10,233 INFO L225 Difference]: With dead ends: 108269 [2019-11-20 03:48:10,233 INFO L226 Difference]: Without dead ends: 62221 [2019-11-20 03:48:10,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-11-20 03:48:10,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62221 states. [2019-11-20 03:48:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62221 to 55412. [2019-11-20 03:48:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55412 states. [2019-11-20 03:48:10,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55412 states to 55412 states and 58843 transitions. [2019-11-20 03:48:10,704 INFO L78 Accepts]: Start accepts. Automaton has 55412 states and 58843 transitions. Word has length 559 [2019-11-20 03:48:10,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:48:10,704 INFO L462 AbstractCegarLoop]: Abstraction has 55412 states and 58843 transitions. [2019-11-20 03:48:10,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:48:10,704 INFO L276 IsEmpty]: Start isEmpty. Operand 55412 states and 58843 transitions. [2019-11-20 03:48:10,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2019-11-20 03:48:10,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:48:10,714 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:48:10,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:48:10,915 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:48:10,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:48:10,915 INFO L82 PathProgramCache]: Analyzing trace with hash 754787691, now seen corresponding path program 1 times [2019-11-20 03:48:10,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:48:10,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389282415] [2019-11-20 03:48:10,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:48:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 479 proven. 5 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-11-20 03:48:11,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389282415] [2019-11-20 03:48:11,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064698619] [2019-11-20 03:48:11,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:48:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:11,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:48:11,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:48:11,967 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-11-20 03:48:11,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:48:11,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2019-11-20 03:48:11,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697200493] [2019-11-20 03:48:11,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:48:11,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:48:11,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:48:11,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-20 03:48:11,969 INFO L87 Difference]: Start difference. First operand 55412 states and 58843 transitions. Second operand 5 states. [2019-11-20 03:48:27,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:48:27,464 INFO L93 Difference]: Finished difference Result 135485 states and 144392 transitions. [2019-11-20 03:48:27,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:48:27,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 591 [2019-11-20 03:48:27,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:48:27,525 INFO L225 Difference]: With dead ends: 135485 [2019-11-20 03:48:27,525 INFO L226 Difference]: Without dead ends: 78796 [2019-11-20 03:48:27,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 590 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-20 03:48:27,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78796 states. [2019-11-20 03:48:28,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78796 to 62203. [2019-11-20 03:48:28,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62203 states. [2019-11-20 03:48:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62203 states to 62203 states and 65824 transitions. [2019-11-20 03:48:28,204 INFO L78 Accepts]: Start accepts. Automaton has 62203 states and 65824 transitions. Word has length 591 [2019-11-20 03:48:28,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:48:28,205 INFO L462 AbstractCegarLoop]: Abstraction has 62203 states and 65824 transitions. [2019-11-20 03:48:28,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:48:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 62203 states and 65824 transitions. [2019-11-20 03:48:28,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2019-11-20 03:48:28,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:48:28,221 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 03:48:28,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:48:28,425 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:48:28,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:48:28,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1483920962, now seen corresponding path program 1 times [2019-11-20 03:48:28,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:48:28,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735245414] [2019-11-20 03:48:28,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:48:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-20 03:48:28,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735245414] [2019-11-20 03:48:28,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:48:28,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:48:28,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917818799] [2019-11-20 03:48:28,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:48:28,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:48:28,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:48:28,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:48:28,795 INFO L87 Difference]: Start difference. First operand 62203 states and 65824 transitions. Second operand 3 states. [2019-11-20 03:48:30,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:48:30,685 INFO L93 Difference]: Finished difference Result 124834 states and 132154 transitions. [2019-11-20 03:48:30,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:48:30,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 595 [2019-11-20 03:48:30,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:48:30,728 INFO L225 Difference]: With dead ends: 124834 [2019-11-20 03:48:30,728 INFO L226 Difference]: Without dead ends: 63058 [2019-11-20 03:48:30,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:48:30,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63058 states. [2019-11-20 03:48:31,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63058 to 58375. [2019-11-20 03:48:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58375 states. [2019-11-20 03:48:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58375 states to 58375 states and 61570 transitions. [2019-11-20 03:48:31,174 INFO L78 Accepts]: Start accepts. Automaton has 58375 states and 61570 transitions. Word has length 595 [2019-11-20 03:48:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:48:31,174 INFO L462 AbstractCegarLoop]: Abstraction has 58375 states and 61570 transitions. [2019-11-20 03:48:31,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:48:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 58375 states and 61570 transitions. [2019-11-20 03:48:31,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2019-11-20 03:48:31,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:48:31,189 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:48:31,189 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:48:31,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:48:31,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1216128928, now seen corresponding path program 1 times [2019-11-20 03:48:31,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:48:31,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049531757] [2019-11-20 03:48:31,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:48:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:31,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 718 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-20 03:48:31,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049531757] [2019-11-20 03:48:31,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:48:31,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:48:31,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047565425] [2019-11-20 03:48:31,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:48:31,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:48:31,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:48:31,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:48:31,975 INFO L87 Difference]: Start difference. First operand 58375 states and 61570 transitions. Second operand 3 states. [2019-11-20 03:48:33,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:48:33,793 INFO L93 Difference]: Finished difference Result 124831 states and 131687 transitions. [2019-11-20 03:48:33,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:48:33,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 638 [2019-11-20 03:48:33,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:48:33,839 INFO L225 Difference]: With dead ends: 124831 [2019-11-20 03:48:33,839 INFO L226 Difference]: Without dead ends: 66883 [2019-11-20 03:48:33,860 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:48:33,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66883 states. [2019-11-20 03:48:34,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66883 to 65599. [2019-11-20 03:48:34,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65599 states. [2019-11-20 03:48:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65599 states to 65599 states and 68983 transitions. [2019-11-20 03:48:34,328 INFO L78 Accepts]: Start accepts. Automaton has 65599 states and 68983 transitions. Word has length 638 [2019-11-20 03:48:34,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:48:34,329 INFO L462 AbstractCegarLoop]: Abstraction has 65599 states and 68983 transitions. [2019-11-20 03:48:34,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:48:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 65599 states and 68983 transitions. [2019-11-20 03:48:34,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2019-11-20 03:48:34,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:48:34,348 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:48:34,348 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:48:34,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:48:34,349 INFO L82 PathProgramCache]: Analyzing trace with hash -236923992, now seen corresponding path program 1 times [2019-11-20 03:48:34,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:48:34,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733078639] [2019-11-20 03:48:34,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:48:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 995 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2019-11-20 03:48:35,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733078639] [2019-11-20 03:48:35,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:48:35,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:48:35,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002644806] [2019-11-20 03:48:35,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:48:35,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:48:35,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:48:35,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:48:35,007 INFO L87 Difference]: Start difference. First operand 65599 states and 68983 transitions. Second operand 3 states. [2019-11-20 03:48:36,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:48:36,602 INFO L93 Difference]: Finished difference Result 138421 states and 145548 transitions. [2019-11-20 03:48:36,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:48:36,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 796 [2019-11-20 03:48:36,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:48:36,659 INFO L225 Difference]: With dead ends: 138421 [2019-11-20 03:48:36,659 INFO L226 Difference]: Without dead ends: 73249 [2019-11-20 03:48:36,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:48:36,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73249 states. [2019-11-20 03:48:37,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73249 to 56224. [2019-11-20 03:48:37,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56224 states. [2019-11-20 03:48:37,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56224 states to 56224 states and 59100 transitions. [2019-11-20 03:48:37,178 INFO L78 Accepts]: Start accepts. Automaton has 56224 states and 59100 transitions. Word has length 796 [2019-11-20 03:48:37,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:48:37,178 INFO L462 AbstractCegarLoop]: Abstraction has 56224 states and 59100 transitions. [2019-11-20 03:48:37,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:48:37,178 INFO L276 IsEmpty]: Start isEmpty. Operand 56224 states and 59100 transitions. [2019-11-20 03:48:37,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2019-11-20 03:48:37,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:48:37,196 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 03:48:37,197 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:48:37,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:48:37,197 INFO L82 PathProgramCache]: Analyzing trace with hash -195082119, now seen corresponding path program 1 times [2019-11-20 03:48:37,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:48:37,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079686701] [2019-11-20 03:48:37,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:48:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 663 proven. 335 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-20 03:48:38,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079686701] [2019-11-20 03:48:38,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632336726] [2019-11-20 03:48:38,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:48:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:39,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 03:48:39,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:48:39,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 566 proven. 82 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2019-11-20 03:48:39,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:48:39,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3] total 10 [2019-11-20 03:48:39,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231461121] [2019-11-20 03:48:39,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 03:48:39,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:48:39,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 03:48:39,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-20 03:48:39,761 INFO L87 Difference]: Start difference. First operand 56224 states and 59100 transitions. Second operand 10 states. [2019-11-20 03:48:52,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:48:52,740 INFO L93 Difference]: Finished difference Result 140135 states and 147223 transitions. [2019-11-20 03:48:52,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 03:48:52,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 809 [2019-11-20 03:48:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:48:52,801 INFO L225 Difference]: With dead ends: 140135 [2019-11-20 03:48:52,801 INFO L226 Difference]: Without dead ends: 83913 [2019-11-20 03:48:52,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 832 GetRequests, 816 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-11-20 03:48:52,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83913 states. [2019-11-20 03:48:53,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83913 to 74526. [2019-11-20 03:48:53,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74526 states. [2019-11-20 03:48:53,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74526 states to 74526 states and 78105 transitions. [2019-11-20 03:48:53,463 INFO L78 Accepts]: Start accepts. Automaton has 74526 states and 78105 transitions. Word has length 809 [2019-11-20 03:48:53,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:48:53,463 INFO L462 AbstractCegarLoop]: Abstraction has 74526 states and 78105 transitions. [2019-11-20 03:48:53,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 03:48:53,464 INFO L276 IsEmpty]: Start isEmpty. Operand 74526 states and 78105 transitions. [2019-11-20 03:48:53,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 904 [2019-11-20 03:48:53,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:48:53,485 INFO L410 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:48:53,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:48:53,689 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:48:53,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:48:53,689 INFO L82 PathProgramCache]: Analyzing trace with hash 749095286, now seen corresponding path program 1 times [2019-11-20 03:48:53,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:48:53,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669936040] [2019-11-20 03:48:53,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:48:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2273 backedges. 1351 proven. 65 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2019-11-20 03:48:54,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669936040] [2019-11-20 03:48:54,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591456035] [2019-11-20 03:48:54,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:48:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:54,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:48:54,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:48:55,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2273 backedges. 1416 proven. 0 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2019-11-20 03:48:55,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:48:55,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-20 03:48:55,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508616312] [2019-11-20 03:48:55,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:48:55,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:48:55,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:48:55,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:48:55,577 INFO L87 Difference]: Start difference. First operand 74526 states and 78105 transitions. Second operand 4 states. [2019-11-20 03:48:57,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:48:57,963 INFO L93 Difference]: Finished difference Result 150325 states and 157572 transitions. [2019-11-20 03:48:57,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:48:57,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 903 [2019-11-20 03:48:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:48:58,016 INFO L225 Difference]: With dead ends: 150325 [2019-11-20 03:48:58,016 INFO L226 Difference]: Without dead ends: 76651 [2019-11-20 03:48:58,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 902 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:48:58,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76651 states. [2019-11-20 03:48:58,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76651 to 76651. [2019-11-20 03:48:58,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76651 states. [2019-11-20 03:48:58,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76651 states to 76651 states and 80200 transitions. [2019-11-20 03:48:58,647 INFO L78 Accepts]: Start accepts. Automaton has 76651 states and 80200 transitions. Word has length 903 [2019-11-20 03:48:58,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:48:58,648 INFO L462 AbstractCegarLoop]: Abstraction has 76651 states and 80200 transitions. [2019-11-20 03:48:58,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:48:58,648 INFO L276 IsEmpty]: Start isEmpty. Operand 76651 states and 80200 transitions. [2019-11-20 03:48:58,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2019-11-20 03:48:58,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:48:58,671 INFO L410 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, 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, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:48:58,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:48:58,872 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:48:58,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:48:58,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1201664773, now seen corresponding path program 1 times [2019-11-20 03:48:58,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:48:58,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870534264] [2019-11-20 03:48:58,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:48:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:48:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2396 backedges. 1451 proven. 0 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2019-11-20 03:48:59,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870534264] [2019-11-20 03:48:59,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:48:59,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:48:59,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218457661] [2019-11-20 03:48:59,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:48:59,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:48:59,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:48:59,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:48:59,704 INFO L87 Difference]: Start difference. First operand 76651 states and 80200 transitions. Second operand 4 states. [2019-11-20 03:49:02,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:49:02,264 INFO L93 Difference]: Finished difference Result 158415 states and 165700 transitions. [2019-11-20 03:49:02,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:49:02,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 955 [2019-11-20 03:49:02,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:49:02,326 INFO L225 Difference]: With dead ends: 158415 [2019-11-20 03:49:02,326 INFO L226 Difference]: Without dead ends: 81766 [2019-11-20 03:49:02,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:49:02,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81766 states. [2019-11-20 03:49:03,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81766 to 76225. [2019-11-20 03:49:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76225 states. [2019-11-20 03:49:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76225 states to 76225 states and 79628 transitions. [2019-11-20 03:49:03,273 INFO L78 Accepts]: Start accepts. Automaton has 76225 states and 79628 transitions. Word has length 955 [2019-11-20 03:49:03,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:49:03,274 INFO L462 AbstractCegarLoop]: Abstraction has 76225 states and 79628 transitions. [2019-11-20 03:49:03,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:49:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 76225 states and 79628 transitions. [2019-11-20 03:49:03,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1032 [2019-11-20 03:49:03,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:49:03,301 INFO L410 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:49:03,301 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:49:03,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:49:03,302 INFO L82 PathProgramCache]: Analyzing trace with hash -115299208, now seen corresponding path program 1 times [2019-11-20 03:49:03,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:49:03,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184191999] [2019-11-20 03:49:03,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:49:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2384 backedges. 963 proven. 0 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2019-11-20 03:49:04,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184191999] [2019-11-20 03:49:04,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:49:04,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 03:49:04,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881947896] [2019-11-20 03:49:04,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:49:04,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:49:04,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:49:04,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:49:04,375 INFO L87 Difference]: Start difference. First operand 76225 states and 79628 transitions. Second operand 5 states. [2019-11-20 03:49:08,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:49:08,205 INFO L93 Difference]: Finished difference Result 168217 states and 176011 transitions. [2019-11-20 03:49:08,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:49:08,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1031 [2019-11-20 03:49:08,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:49:08,277 INFO L225 Difference]: With dead ends: 168217 [2019-11-20 03:49:08,277 INFO L226 Difference]: Without dead ends: 92419 [2019-11-20 03:49:08,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:49:08,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92419 states. [2019-11-20 03:49:08,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92419 to 72395. [2019-11-20 03:49:08,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72395 states. [2019-11-20 03:49:08,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72395 states to 72395 states and 75699 transitions. [2019-11-20 03:49:08,948 INFO L78 Accepts]: Start accepts. Automaton has 72395 states and 75699 transitions. Word has length 1031 [2019-11-20 03:49:08,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:49:08,948 INFO L462 AbstractCegarLoop]: Abstraction has 72395 states and 75699 transitions. [2019-11-20 03:49:08,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:49:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 72395 states and 75699 transitions. [2019-11-20 03:49:08,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2019-11-20 03:49:08,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:49:08,979 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:49:08,979 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:49:08,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:49:08,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1807092396, now seen corresponding path program 1 times [2019-11-20 03:49:08,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:49:08,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339789420] [2019-11-20 03:49:08,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:49:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1802 backedges. 1243 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2019-11-20 03:49:11,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339789420] [2019-11-20 03:49:11,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:49:11,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:49:11,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057372782] [2019-11-20 03:49:11,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:49:11,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:49:11,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:49:11,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:49:11,110 INFO L87 Difference]: Start difference. First operand 72395 states and 75699 transitions. Second operand 3 states. [2019-11-20 03:49:13,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:49:13,465 INFO L93 Difference]: Finished difference Result 145219 states and 151855 transitions. [2019-11-20 03:49:13,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:49:13,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1103 [2019-11-20 03:49:13,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:49:13,520 INFO L225 Difference]: With dead ends: 145219 [2019-11-20 03:49:13,521 INFO L226 Difference]: Without dead ends: 73676 [2019-11-20 03:49:13,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:49:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73676 states. [2019-11-20 03:49:14,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73676 to 72393. [2019-11-20 03:49:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72393 states. [2019-11-20 03:49:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72393 states to 72393 states and 75450 transitions. [2019-11-20 03:49:14,127 INFO L78 Accepts]: Start accepts. Automaton has 72393 states and 75450 transitions. Word has length 1103 [2019-11-20 03:49:14,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:49:14,128 INFO L462 AbstractCegarLoop]: Abstraction has 72393 states and 75450 transitions. [2019-11-20 03:49:14,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:49:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 72393 states and 75450 transitions. [2019-11-20 03:49:14,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1111 [2019-11-20 03:49:14,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:49:14,157 INFO L410 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:49:14,158 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:49:14,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:49:14,158 INFO L82 PathProgramCache]: Analyzing trace with hash -881943503, now seen corresponding path program 1 times [2019-11-20 03:49:14,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:49:14,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493333900] [2019-11-20 03:49:14,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:49:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:16,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2385 backedges. 1698 proven. 143 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-11-20 03:49:16,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493333900] [2019-11-20 03:49:16,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027484773] [2019-11-20 03:49:16,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:49:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:16,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 03:49:16,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:49:16,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:49:16,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:49:16,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:49:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2385 backedges. 1841 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-11-20 03:49:19,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:49:19,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-20 03:49:19,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071835324] [2019-11-20 03:49:19,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:49:19,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:49:19,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:49:19,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:49:19,611 INFO L87 Difference]: Start difference. First operand 72393 states and 75450 transitions. Second operand 4 states. [2019-11-20 03:49:27,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:49:27,546 INFO L93 Difference]: Finished difference Result 164372 states and 171206 transitions. [2019-11-20 03:49:27,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:49:27,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1110 [2019-11-20 03:49:27,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:49:27,609 INFO L225 Difference]: With dead ends: 164372 [2019-11-20 03:49:27,609 INFO L226 Difference]: Without dead ends: 92831 [2019-11-20 03:49:27,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1116 GetRequests, 1109 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:49:27,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92831 states. [2019-11-20 03:49:28,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92831 to 78362. [2019-11-20 03:49:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78362 states. [2019-11-20 03:49:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78362 states to 78362 states and 81661 transitions. [2019-11-20 03:49:28,298 INFO L78 Accepts]: Start accepts. Automaton has 78362 states and 81661 transitions. Word has length 1110 [2019-11-20 03:49:28,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:49:28,299 INFO L462 AbstractCegarLoop]: Abstraction has 78362 states and 81661 transitions. [2019-11-20 03:49:28,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:49:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 78362 states and 81661 transitions. [2019-11-20 03:49:28,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1122 [2019-11-20 03:49:28,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:49:28,337 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 03:49:28,537 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:49:28,538 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:49:28,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:49:28,538 INFO L82 PathProgramCache]: Analyzing trace with hash -204436311, now seen corresponding path program 1 times [2019-11-20 03:49:28,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:49:28,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505923504] [2019-11-20 03:49:28,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:49:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 744 proven. 6 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2019-11-20 03:49:29,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505923504] [2019-11-20 03:49:29,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068842052] [2019-11-20 03:49:29,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:49:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:49:30,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:49:30,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:49:31,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 736 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2019-11-20 03:49:31,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:49:31,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-20 03:49:31,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010977795] [2019-11-20 03:49:31,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:49:31,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:49:31,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:49:31,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:49:31,110 INFO L87 Difference]: Start difference. First operand 78362 states and 81661 transitions. Second operand 4 states. [2019-11-20 03:50:07,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:07,768 INFO L93 Difference]: Finished difference Result 192499 states and 200789 transitions. [2019-11-20 03:50:07,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:50:07,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1121 [2019-11-20 03:50:07,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:07,853 INFO L225 Difference]: With dead ends: 192499 [2019-11-20 03:50:07,853 INFO L226 Difference]: Without dead ends: 113714 [2019-11-20 03:50:07,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1127 GetRequests, 1120 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:50:07,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113714 states. [2019-11-20 03:50:08,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113714 to 99663. [2019-11-20 03:50:08,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99663 states. [2019-11-20 03:50:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99663 states to 99663 states and 104030 transitions. [2019-11-20 03:50:09,005 INFO L78 Accepts]: Start accepts. Automaton has 99663 states and 104030 transitions. Word has length 1121 [2019-11-20 03:50:09,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:09,005 INFO L462 AbstractCegarLoop]: Abstraction has 99663 states and 104030 transitions. [2019-11-20 03:50:09,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:50:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 99663 states and 104030 transitions. [2019-11-20 03:50:09,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1156 [2019-11-20 03:50:09,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:09,045 INFO L410 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, 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, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:09,245 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:50:09,246 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:09,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:09,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1008432611, now seen corresponding path program 1 times [2019-11-20 03:50:09,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:50:09,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465138309] [2019-11-20 03:50:09,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:50:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:10,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2861 backedges. 1057 proven. 0 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2019-11-20 03:50:10,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465138309] [2019-11-20 03:50:10,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:10,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:50:10,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842832911] [2019-11-20 03:50:10,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:50:10,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:50:10,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:50:10,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:50:10,427 INFO L87 Difference]: Start difference. First operand 99663 states and 104030 transitions. Second operand 3 states. [2019-11-20 03:50:12,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:12,353 INFO L93 Difference]: Finished difference Result 208241 states and 217280 transitions. [2019-11-20 03:50:12,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:50:12,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1155 [2019-11-20 03:50:12,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:12,437 INFO L225 Difference]: With dead ends: 208241 [2019-11-20 03:50:12,437 INFO L226 Difference]: Without dead ends: 109430 [2019-11-20 03:50:12,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:50:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109430 states. [2019-11-20 03:50:13,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109430 to 92812. [2019-11-20 03:50:13,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92812 states. [2019-11-20 03:50:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92812 states to 92812 states and 96179 transitions. [2019-11-20 03:50:13,648 INFO L78 Accepts]: Start accepts. Automaton has 92812 states and 96179 transitions. Word has length 1155 [2019-11-20 03:50:13,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:13,649 INFO L462 AbstractCegarLoop]: Abstraction has 92812 states and 96179 transitions. [2019-11-20 03:50:13,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:50:13,649 INFO L276 IsEmpty]: Start isEmpty. Operand 92812 states and 96179 transitions. [2019-11-20 03:50:13,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1196 [2019-11-20 03:50:13,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:13,678 INFO L410 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:13,678 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:13,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:13,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1621241508, now seen corresponding path program 1 times [2019-11-20 03:50:13,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:50:13,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326858436] [2019-11-20 03:50:13,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:50:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2602 backedges. 1917 proven. 143 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-11-20 03:50:16,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326858436] [2019-11-20 03:50:16,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418692695] [2019-11-20 03:50:16,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:50:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:16,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 1411 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 03:50:16,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:16,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:50:19,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2602 backedges. 2060 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-11-20 03:50:19,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:50:19,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-11-20 03:50:19,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472137212] [2019-11-20 03:50:19,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:50:19,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:50:19,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:50:19,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-20 03:50:19,853 INFO L87 Difference]: Start difference. First operand 92812 states and 96179 transitions. Second operand 4 states. [2019-11-20 03:50:24,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:24,848 INFO L93 Difference]: Finished difference Result 214140 states and 221758 transitions. [2019-11-20 03:50:24,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:50:24,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1195 [2019-11-20 03:50:24,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:24,937 INFO L225 Difference]: With dead ends: 214140 [2019-11-20 03:50:24,937 INFO L226 Difference]: Without dead ends: 121755 [2019-11-20 03:50:24,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1202 GetRequests, 1194 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-20 03:50:25,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121755 states. [2019-11-20 03:50:25,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121755 to 104301. [2019-11-20 03:50:25,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104301 states. [2019-11-20 03:50:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104301 states to 104301 states and 108071 transitions. [2019-11-20 03:50:25,858 INFO L78 Accepts]: Start accepts. Automaton has 104301 states and 108071 transitions. Word has length 1195 [2019-11-20 03:50:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:25,859 INFO L462 AbstractCegarLoop]: Abstraction has 104301 states and 108071 transitions. [2019-11-20 03:50:25,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:50:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 104301 states and 108071 transitions. [2019-11-20 03:50:25,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1359 [2019-11-20 03:50:25,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:25,902 INFO L410 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:26,102 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:50:26,103 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:26,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:26,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1366747237, now seen corresponding path program 1 times [2019-11-20 03:50:26,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:50:26,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197466666] [2019-11-20 03:50:26,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:50:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3285 backedges. 1991 proven. 0 refuted. 0 times theorem prover too weak. 1294 trivial. 0 not checked. [2019-11-20 03:50:28,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197466666] [2019-11-20 03:50:28,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:50:28,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 03:50:28,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036589585] [2019-11-20 03:50:28,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:50:28,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:50:28,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:50:28,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:50:28,122 INFO L87 Difference]: Start difference. First operand 104301 states and 108071 transitions. Second operand 6 states. [2019-11-20 03:50:31,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:50:31,808 INFO L93 Difference]: Finished difference Result 202208 states and 209566 transitions. [2019-11-20 03:50:31,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:50:31,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1358 [2019-11-20 03:50:31,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:50:31,878 INFO L225 Difference]: With dead ends: 202208 [2019-11-20 03:50:31,878 INFO L226 Difference]: Without dead ends: 98334 [2019-11-20 03:50:31,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:50:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98334 states. [2019-11-20 03:50:32,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98334 to 86836. [2019-11-20 03:50:32,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86836 states. [2019-11-20 03:50:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86836 states to 86836 states and 89839 transitions. [2019-11-20 03:50:32,559 INFO L78 Accepts]: Start accepts. Automaton has 86836 states and 89839 transitions. Word has length 1358 [2019-11-20 03:50:32,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:50:32,560 INFO L462 AbstractCegarLoop]: Abstraction has 86836 states and 89839 transitions. [2019-11-20 03:50:32,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:50:32,560 INFO L276 IsEmpty]: Start isEmpty. Operand 86836 states and 89839 transitions. [2019-11-20 03:50:32,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1493 [2019-11-20 03:50:32,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:50:32,605 INFO L410 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:50:32,606 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:50:32,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:50:32,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1113059779, now seen corresponding path program 1 times [2019-11-20 03:50:32,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:50:32,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199898907] [2019-11-20 03:50:32,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:50:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3255 backedges. 2428 proven. 550 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-11-20 03:50:34,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199898907] [2019-11-20 03:50:34,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079722794] [2019-11-20 03:50:34,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:50:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:50:35,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 1720 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 03:50:35,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:50:35,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 03:50:35,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:50:35,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:50:35,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:50:35,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:50:35,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:50:35,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:50:35,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:50:35,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:50:35,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:50:35,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:50:35,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:50:35,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:50:35,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:50:35,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 03:50:35,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:50:35,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:50:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3255 backedges. 1624 proven. 1336 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2019-11-20 03:50:40,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:50:40,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-11-20 03:50:40,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192549310] [2019-11-20 03:50:40,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 03:50:40,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:50:40,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 03:50:40,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-20 03:50:40,138 INFO L87 Difference]: Start difference. First operand 86836 states and 89839 transitions. Second operand 13 states. [2019-11-20 03:51:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:51:16,172 INFO L93 Difference]: Finished difference Result 211343 states and 218610 transitions. [2019-11-20 03:51:16,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-11-20 03:51:16,172 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1492 [2019-11-20 03:51:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:51:16,269 INFO L225 Difference]: With dead ends: 211343 [2019-11-20 03:51:16,269 INFO L226 Difference]: Without dead ends: 124078 [2019-11-20 03:51:16,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1655 GetRequests, 1563 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1620, Invalid=7122, Unknown=0, NotChecked=0, Total=8742 [2019-11-20 03:51:16,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124078 states. [2019-11-20 03:51:17,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124078 to 96196. [2019-11-20 03:51:17,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96196 states. [2019-11-20 03:51:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96196 states to 96196 states and 99446 transitions. [2019-11-20 03:51:17,252 INFO L78 Accepts]: Start accepts. Automaton has 96196 states and 99446 transitions. Word has length 1492 [2019-11-20 03:51:17,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:51:17,253 INFO L462 AbstractCegarLoop]: Abstraction has 96196 states and 99446 transitions. [2019-11-20 03:51:17,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 03:51:17,253 INFO L276 IsEmpty]: Start isEmpty. Operand 96196 states and 99446 transitions. [2019-11-20 03:51:17,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1893 [2019-11-20 03:51:17,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:51:17,311 INFO L410 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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:51:17,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:51:17,512 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:51:17,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:51:17,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1060407296, now seen corresponding path program 1 times [2019-11-20 03:51:17,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:51:17,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725621049] [2019-11-20 03:51:17,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:51:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:51:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4623 backedges. 3750 proven. 0 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2019-11-20 03:51:21,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725621049] [2019-11-20 03:51:21,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:51:21,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 03:51:21,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62576917] [2019-11-20 03:51:21,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:51:21,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:51:21,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:51:21,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:51:21,862 INFO L87 Difference]: Start difference. First operand 96196 states and 99446 transitions. Second operand 6 states. [2019-11-20 03:51:26,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:51:26,264 INFO L93 Difference]: Finished difference Result 211973 states and 218976 transitions. [2019-11-20 03:51:26,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:51:26,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1892 [2019-11-20 03:51:26,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:51:26,355 INFO L225 Difference]: With dead ends: 211973 [2019-11-20 03:51:26,355 INFO L226 Difference]: Without dead ends: 116204 [2019-11-20 03:51:26,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:51:26,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116204 states. [2019-11-20 03:51:27,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116204 to 97052. [2019-11-20 03:51:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97052 states. [2019-11-20 03:51:27,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97052 states to 97052 states and 100232 transitions. [2019-11-20 03:51:27,248 INFO L78 Accepts]: Start accepts. Automaton has 97052 states and 100232 transitions. Word has length 1892 [2019-11-20 03:51:27,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:51:27,249 INFO L462 AbstractCegarLoop]: Abstraction has 97052 states and 100232 transitions. [2019-11-20 03:51:27,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:51:27,249 INFO L276 IsEmpty]: Start isEmpty. Operand 97052 states and 100232 transitions. [2019-11-20 03:51:27,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1980 [2019-11-20 03:51:27,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:51:27,309 INFO L410 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:51:27,463 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:51:27,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:51:27,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1099028230, now seen corresponding path program 1 times [2019-11-20 03:51:27,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:51:27,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273721105] [2019-11-20 03:51:27,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:51:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:51:30,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5114 backedges. 3733 proven. 0 refuted. 0 times theorem prover too weak. 1381 trivial. 0 not checked. [2019-11-20 03:51:30,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273721105] [2019-11-20 03:51:30,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:51:30,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 03:51:30,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667088745] [2019-11-20 03:51:30,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:51:30,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:51:30,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:51:30,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:51:30,611 INFO L87 Difference]: Start difference. First operand 97052 states and 100232 transitions. Second operand 5 states. [2019-11-20 03:51:34,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:51:34,023 INFO L93 Difference]: Finished difference Result 206042 states and 212718 transitions. [2019-11-20 03:51:34,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:51:34,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1979 [2019-11-20 03:51:34,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:51:34,109 INFO L225 Difference]: With dead ends: 206042 [2019-11-20 03:51:34,109 INFO L226 Difference]: Without dead ends: 109417 [2019-11-20 03:51:34,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:51:34,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109417 states. [2019-11-20 03:51:34,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109417 to 97479. [2019-11-20 03:51:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97479 states. [2019-11-20 03:51:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97479 states to 97479 states and 100641 transitions. [2019-11-20 03:51:34,972 INFO L78 Accepts]: Start accepts. Automaton has 97479 states and 100641 transitions. Word has length 1979 [2019-11-20 03:51:34,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:51:34,972 INFO L462 AbstractCegarLoop]: Abstraction has 97479 states and 100641 transitions. [2019-11-20 03:51:34,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:51:34,972 INFO L276 IsEmpty]: Start isEmpty. Operand 97479 states and 100641 transitions. [2019-11-20 03:51:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2063 [2019-11-20 03:51:35,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:51:35,035 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:51:35,035 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:51:35,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:51:35,036 INFO L82 PathProgramCache]: Analyzing trace with hash 604683623, now seen corresponding path program 1 times [2019-11-20 03:51:35,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:51:35,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878318465] [2019-11-20 03:51:35,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:51:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:51:38,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6200 backedges. 4247 proven. 0 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-11-20 03:51:38,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878318465] [2019-11-20 03:51:38,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:51:38,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 03:51:38,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781903500] [2019-11-20 03:51:38,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:51:38,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:51:38,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:51:38,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:51:38,250 INFO L87 Difference]: Start difference. First operand 97479 states and 100641 transitions. Second operand 5 states. [2019-11-20 03:51:41,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:51:41,603 INFO L93 Difference]: Finished difference Result 206470 states and 213085 transitions. [2019-11-20 03:51:41,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:51:41,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 2062 [2019-11-20 03:51:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:51:41,691 INFO L225 Difference]: With dead ends: 206470 [2019-11-20 03:51:41,691 INFO L226 Difference]: Without dead ends: 109418 [2019-11-20 03:51:41,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:51:41,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109418 states. [2019-11-20 03:51:42,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109418 to 97052. [2019-11-20 03:51:42,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97052 states. [2019-11-20 03:51:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97052 states to 97052 states and 100189 transitions. [2019-11-20 03:51:42,791 INFO L78 Accepts]: Start accepts. Automaton has 97052 states and 100189 transitions. Word has length 2062 [2019-11-20 03:51:42,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:51:42,792 INFO L462 AbstractCegarLoop]: Abstraction has 97052 states and 100189 transitions. [2019-11-20 03:51:42,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:51:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 97052 states and 100189 transitions. [2019-11-20 03:51:42,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2280 [2019-11-20 03:51:42,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:51:42,860 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:51:42,860 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:51:42,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:51:42,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1562803815, now seen corresponding path program 1 times [2019-11-20 03:51:42,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:51:42,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276080118] [2019-11-20 03:51:42,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:51:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:52:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6680 backedges. 2321 proven. 4277 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-20 03:52:04,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276080118] [2019-11-20 03:52:04,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927578545] [2019-11-20 03:52:04,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:52:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:52:05,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 2577 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:52:05,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:52:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6680 backedges. 5323 proven. 0 refuted. 0 times theorem prover too weak. 1357 trivial. 0 not checked. [2019-11-20 03:52:10,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:52:10,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [22] total 25 [2019-11-20 03:52:10,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501428737] [2019-11-20 03:52:10,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:52:10,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:52:10,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:52:10,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-11-20 03:52:10,156 INFO L87 Difference]: Start difference. First operand 97052 states and 100189 transitions. Second operand 4 states. [2019-11-20 03:52:29,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:52:29,520 INFO L93 Difference]: Finished difference Result 210285 states and 217117 transitions. [2019-11-20 03:52:29,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:52:29,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2279 [2019-11-20 03:52:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:52:29,608 INFO L225 Difference]: With dead ends: 210285 [2019-11-20 03:52:29,609 INFO L226 Difference]: Without dead ends: 113660 [2019-11-20 03:52:29,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2302 GetRequests, 2277 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-11-20 03:52:29,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113660 states. [2019-11-20 03:52:30,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113660 to 83432. [2019-11-20 03:52:30,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83432 states. [2019-11-20 03:52:30,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83432 states to 83432 states and 86037 transitions. [2019-11-20 03:52:30,441 INFO L78 Accepts]: Start accepts. Automaton has 83432 states and 86037 transitions. Word has length 2279 [2019-11-20 03:52:30,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:52:30,442 INFO L462 AbstractCegarLoop]: Abstraction has 83432 states and 86037 transitions. [2019-11-20 03:52:30,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:52:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 83432 states and 86037 transitions. [2019-11-20 03:52:30,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2308 [2019-11-20 03:52:30,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:52:30,504 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:52:30,705 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:52:30,705 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:52:30,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:52:30,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1001039699, now seen corresponding path program 1 times [2019-11-20 03:52:30,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:52:30,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862654955] [2019-11-20 03:52:30,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:52:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:52:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8982 backedges. 6129 proven. 1117 refuted. 0 times theorem prover too weak. 1736 trivial. 0 not checked. [2019-11-20 03:52:36,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862654955] [2019-11-20 03:52:36,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725730830] [2019-11-20 03:52:36,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:52:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:52:37,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 2660 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 03:52:37,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:52:37,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:52:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8982 backedges. 3537 proven. 0 refuted. 0 times theorem prover too weak. 5445 trivial. 0 not checked. [2019-11-20 03:52:41,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:52:41,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-11-20 03:52:41,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043137825] [2019-11-20 03:52:41,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:52:41,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:52:41,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:52:41,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:52:41,738 INFO L87 Difference]: Start difference. First operand 83432 states and 86037 transitions. Second operand 3 states. [2019-11-20 03:52:44,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:52:44,983 INFO L93 Difference]: Finished difference Result 167714 states and 172808 transitions. [2019-11-20 03:52:44,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:52:44,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2307 [2019-11-20 03:52:44,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:52:45,045 INFO L225 Difference]: With dead ends: 167714 [2019-11-20 03:52:45,045 INFO L226 Difference]: Without dead ends: 84709 [2019-11-20 03:52:45,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2317 GetRequests, 2307 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:52:45,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84709 states. [2019-11-20 03:52:45,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84709 to 80441. [2019-11-20 03:52:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80441 states. [2019-11-20 03:52:45,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80441 states to 80441 states and 82725 transitions. [2019-11-20 03:52:45,761 INFO L78 Accepts]: Start accepts. Automaton has 80441 states and 82725 transitions. Word has length 2307 [2019-11-20 03:52:45,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:52:45,763 INFO L462 AbstractCegarLoop]: Abstraction has 80441 states and 82725 transitions. [2019-11-20 03:52:45,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:52:45,763 INFO L276 IsEmpty]: Start isEmpty. Operand 80441 states and 82725 transitions. [2019-11-20 03:52:45,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2454 [2019-11-20 03:52:45,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:52:45,832 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:52:46,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:52:46,032 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:52:46,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:52:46,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1238893721, now seen corresponding path program 1 times [2019-11-20 03:52:46,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:52:46,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926274173] [2019-11-20 03:52:46,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:52:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:52:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 8525 backedges. 6035 proven. 0 refuted. 0 times theorem prover too weak. 2490 trivial. 0 not checked. [2019-11-20 03:52:50,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926274173] [2019-11-20 03:52:50,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:52:50,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 03:52:50,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752076839] [2019-11-20 03:52:50,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:52:50,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:52:50,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:52:50,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:52:50,115 INFO L87 Difference]: Start difference. First operand 80441 states and 82725 transitions. Second operand 6 states. [2019-11-20 03:52:54,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:52:54,360 INFO L93 Difference]: Finished difference Result 168964 states and 173664 transitions. [2019-11-20 03:52:54,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:52:54,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 2453 [2019-11-20 03:52:54,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:52:54,423 INFO L225 Difference]: With dead ends: 168964 [2019-11-20 03:52:54,423 INFO L226 Difference]: Without dead ends: 88950 [2019-11-20 03:52:54,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:52:54,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88950 states. [2019-11-20 03:52:55,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88950 to 71924. [2019-11-20 03:52:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71924 states. [2019-11-20 03:52:55,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71924 states to 71924 states and 73771 transitions. [2019-11-20 03:52:55,361 INFO L78 Accepts]: Start accepts. Automaton has 71924 states and 73771 transitions. Word has length 2453 [2019-11-20 03:52:55,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:52:55,362 INFO L462 AbstractCegarLoop]: Abstraction has 71924 states and 73771 transitions. [2019-11-20 03:52:55,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:52:55,362 INFO L276 IsEmpty]: Start isEmpty. Operand 71924 states and 73771 transitions. [2019-11-20 03:52:55,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2510 [2019-11-20 03:52:55,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:52:55,427 INFO L410 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, 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, 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, 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, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2019-11-20 03:52:55,427 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:52:55,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:52:55,428 INFO L82 PathProgramCache]: Analyzing trace with hash -690805896, now seen corresponding path program 1 times [2019-11-20 03:52:55,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:52:55,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128704954] [2019-11-20 03:52:55,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:52:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:53:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 7594 backedges. 6083 proven. 0 refuted. 0 times theorem prover too weak. 1511 trivial. 0 not checked. [2019-11-20 03:53:01,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128704954] [2019-11-20 03:53:01,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:53:01,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 03:53:01,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936361413] [2019-11-20 03:53:01,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 03:53:01,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:53:01,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 03:53:01,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:53:01,169 INFO L87 Difference]: Start difference. First operand 71924 states and 73771 transitions. Second operand 7 states. [2019-11-20 03:53:05,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:53:05,960 INFO L93 Difference]: Finished difference Result 154066 states and 157986 transitions. [2019-11-20 03:53:05,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 03:53:05,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 2509 [2019-11-20 03:53:05,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:53:05,961 INFO L225 Difference]: With dead ends: 154066 [2019-11-20 03:53:05,962 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 03:53:05,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:53:05,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 03:53:05,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 03:53:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 03:53:05,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 03:53:05,991 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2509 [2019-11-20 03:53:05,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:53:05,992 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 03:53:05,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 03:53:05,992 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 03:53:05,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 03:53:05,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 03:53:15,005 WARN L191 SmtUtils]: Spent 8.99 s on a formula simplification. DAG size of input: 2407 DAG size of output: 1891 [2019-11-20 03:53:22,870 WARN L191 SmtUtils]: Spent 7.86 s on a formula simplification. DAG size of input: 2357 DAG size of output: 1857 [2019-11-20 03:53:30,930 WARN L191 SmtUtils]: Spent 8.05 s on a formula simplification. DAG size of input: 2407 DAG size of output: 1891 [2019-11-20 03:53:59,359 WARN L191 SmtUtils]: Spent 28.41 s on a formula simplification. DAG size of input: 1784 DAG size of output: 223 [2019-11-20 03:54:29,596 WARN L191 SmtUtils]: Spent 30.23 s on a formula simplification. DAG size of input: 1756 DAG size of output: 238 [2019-11-20 03:54:58,171 WARN L191 SmtUtils]: Spent 28.57 s on a formula simplification. DAG size of input: 1784 DAG size of output: 223 [2019-11-20 03:54:58,173 INFO L444 ceAbstractionStarter]: For program point L1819(lines 1819 1830) no Hoare annotation was computed. [2019-11-20 03:54:58,173 INFO L444 ceAbstractionStarter]: For program point L762(lines 762 770) no Hoare annotation was computed. [2019-11-20 03:54:58,173 INFO L444 ceAbstractionStarter]: For program point L1819-2(lines 1819 1830) no Hoare annotation was computed. [2019-11-20 03:54:58,174 INFO L444 ceAbstractionStarter]: For program point L762-2(lines 762 770) no Hoare annotation was computed. [2019-11-20 03:54:58,174 INFO L444 ceAbstractionStarter]: For program point L1291(lines 1291 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,174 INFO L444 ceAbstractionStarter]: For program point L1159(lines 1159 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,174 INFO L444 ceAbstractionStarter]: For program point L1556(lines 1556 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,174 INFO L444 ceAbstractionStarter]: For program point L1424(lines 1424 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,174 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,174 INFO L444 ceAbstractionStarter]: For program point L103-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,174 INFO L444 ceAbstractionStarter]: For program point L1028(lines 1028 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,174 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 377) no Hoare annotation was computed. [2019-11-20 03:54:58,174 INFO L444 ceAbstractionStarter]: For program point L368-2(lines 368 377) no Hoare annotation was computed. [2019-11-20 03:54:58,174 INFO L444 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2019-11-20 03:54:58,174 INFO L444 ceAbstractionStarter]: For program point L2086(lines 2086 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,174 INFO L444 ceAbstractionStarter]: For program point L2351(lines 2351 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,174 INFO L444 ceAbstractionStarter]: For program point L898(lines 898 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,174 INFO L444 ceAbstractionStarter]: For program point L634(lines 634 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,174 INFO L444 ceAbstractionStarter]: For program point L502(lines 502 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,175 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,175 INFO L444 ceAbstractionStarter]: For program point L2220(lines 2220 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,175 INFO L444 ceAbstractionStarter]: For program point L106-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,175 INFO L444 ceAbstractionStarter]: For program point L1956(lines 1956 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,175 INFO L444 ceAbstractionStarter]: For program point L899(lines 899 908) no Hoare annotation was computed. [2019-11-20 03:54:58,175 INFO L444 ceAbstractionStarter]: For program point L899-2(lines 899 908) no Hoare annotation was computed. [2019-11-20 03:54:58,175 INFO L444 ceAbstractionStarter]: For program point L1428(lines 1428 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,175 INFO L444 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-11-20 03:54:58,175 INFO L444 ceAbstractionStarter]: For program point L2486(lines 2486 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,176 INFO L444 ceAbstractionStarter]: For program point L1429(lines 1429 1439) no Hoare annotation was computed. [2019-11-20 03:54:58,176 INFO L444 ceAbstractionStarter]: For program point L1429-2(lines 1429 1439) no Hoare annotation was computed. [2019-11-20 03:54:58,176 INFO L444 ceAbstractionStarter]: For program point L1297(lines 1297 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,176 INFO L444 ceAbstractionStarter]: For program point L1694(lines 1694 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,176 INFO L444 ceAbstractionStarter]: For program point L1166(lines 1166 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,176 INFO L444 ceAbstractionStarter]: For program point L109-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,177 INFO L444 ceAbstractionStarter]: For program point L1034(lines 1034 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,177 INFO L444 ceAbstractionStarter]: For program point L1563(lines 1563 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,177 INFO L444 ceAbstractionStarter]: For program point L2224(lines 2224 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,177 INFO L444 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-11-20 03:54:58,177 INFO L444 ceAbstractionStarter]: For program point L2092(lines 2092 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,177 INFO L444 ceAbstractionStarter]: For program point L771(lines 771 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,177 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,177 INFO L444 ceAbstractionStarter]: For program point L243(lines 243 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,177 INFO L444 ceAbstractionStarter]: For program point L640(lines 640 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,177 INFO L444 ceAbstractionStarter]: For program point L2358(lines 2358 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,177 INFO L444 ceAbstractionStarter]: For program point L112-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,177 INFO L444 ceAbstractionStarter]: For program point L2491(lines 2491 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,178 INFO L444 ceAbstractionStarter]: For program point L113(line 113) no Hoare annotation was computed. [2019-11-20 03:54:58,178 INFO L444 ceAbstractionStarter]: For program point L2095(lines 2095 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,178 INFO L444 ceAbstractionStarter]: For program point L1963(lines 1963 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,178 INFO L444 ceAbstractionStarter]: For program point L1831(lines 1831 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,179 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,179 INFO L444 ceAbstractionStarter]: For program point L1303(lines 1303 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,179 INFO L444 ceAbstractionStarter]: For program point L1964(lines 1964 1974) no Hoare annotation was computed. [2019-11-20 03:54:58,179 INFO L444 ceAbstractionStarter]: For program point L1964-2(lines 1964 1974) no Hoare annotation was computed. [2019-11-20 03:54:58,179 INFO L444 ceAbstractionStarter]: For program point L1700(lines 1700 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,179 INFO L444 ceAbstractionStarter]: For program point L1172(lines 1172 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,179 INFO L444 ceAbstractionStarter]: For program point L115-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,179 INFO L444 ceAbstractionStarter]: For program point L1040(lines 1040 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,180 INFO L444 ceAbstractionStarter]: For program point L776(lines 776 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,180 INFO L444 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-11-20 03:54:58,180 INFO L444 ceAbstractionStarter]: For program point L909(lines 909 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,180 INFO L444 ceAbstractionStarter]: For program point L1570(lines 1570 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,180 INFO L444 ceAbstractionStarter]: For program point L1306(lines 1306 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,180 INFO L444 ceAbstractionStarter]: For program point L249(lines 249 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,180 INFO L444 ceAbstractionStarter]: For program point L2231(lines 2231 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,181 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,181 INFO L444 ceAbstractionStarter]: For program point L2496(lines 2496 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,181 INFO L444 ceAbstractionStarter]: For program point L2232(lines 2232 2243) no Hoare annotation was computed. [2019-11-20 03:54:58,181 INFO L444 ceAbstractionStarter]: For program point L2232-2(lines 2232 2243) no Hoare annotation was computed. [2019-11-20 03:54:58,181 INFO L444 ceAbstractionStarter]: For program point L118-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,181 INFO L444 ceAbstractionStarter]: For program point L647(lines 647 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,181 INFO L444 ceAbstractionStarter]: For program point L1440(lines 1440 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,181 INFO L444 ceAbstractionStarter]: For program point L2365(lines 2365 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,182 INFO L444 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2019-11-20 03:54:58,182 INFO L444 ceAbstractionStarter]: For program point L1044(lines 1044 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,182 INFO L444 ceAbstractionStarter]: For program point L2101(lines 2101 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,182 INFO L444 ceAbstractionStarter]: For program point L1837(lines 1837 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,182 INFO L444 ceAbstractionStarter]: For program point L913(lines 913 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,182 INFO L444 ceAbstractionStarter]: For program point L781(lines 781 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,182 INFO L444 ceAbstractionStarter]: For program point L1574(lines 1574 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,182 INFO L444 ceAbstractionStarter]: For program point L385(lines 385 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,183 INFO L444 ceAbstractionStarter]: For program point L121-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,183 INFO L444 ceAbstractionStarter]: For program point L1707(lines 1707 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,183 INFO L444 ceAbstractionStarter]: For program point L1575(lines 1575 1581) no Hoare annotation was computed. [2019-11-20 03:54:58,183 INFO L444 ceAbstractionStarter]: For program point L1575-2(lines 1575 1581) no Hoare annotation was computed. [2019-11-20 03:54:58,183 INFO L444 ceAbstractionStarter]: For program point L1179(lines 1179 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,183 INFO L444 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-11-20 03:54:58,183 INFO L444 ceAbstractionStarter]: For program point L1708(lines 1708 1717) no Hoare annotation was computed. [2019-11-20 03:54:58,184 INFO L444 ceAbstractionStarter]: For program point L1708-2(lines 1708 1717) no Hoare annotation was computed. [2019-11-20 03:54:58,184 INFO L444 ceAbstractionStarter]: For program point L1444(lines 1444 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,184 INFO L444 ceAbstractionStarter]: For program point L2105(lines 2105 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,184 INFO L444 ceAbstractionStarter]: For program point L2502(lines 2502 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,184 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,184 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,184 INFO L444 ceAbstractionStarter]: For program point L124-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,184 INFO L444 ceAbstractionStarter]: For program point L2106(lines 2106 2112) no Hoare annotation was computed. [2019-11-20 03:54:58,185 INFO L444 ceAbstractionStarter]: For program point L2106-2(lines 2106 2112) no Hoare annotation was computed. [2019-11-20 03:54:58,185 INFO L444 ceAbstractionStarter]: For program point L1842(lines 1842 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,185 INFO L444 ceAbstractionStarter]: For program point L653(lines 653 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,185 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,185 INFO L444 ceAbstractionStarter]: For program point L2371(lines 2371 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,185 INFO L444 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2019-11-20 03:54:58,185 INFO L444 ceAbstractionStarter]: For program point L1050(lines 1050 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,186 INFO L444 ceAbstractionStarter]: For program point L1975(lines 1975 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,186 INFO L444 ceAbstractionStarter]: For program point L522(lines 522 531) no Hoare annotation was computed. [2019-11-20 03:54:58,186 INFO L444 ceAbstractionStarter]: For program point L522-2(lines 522 531) no Hoare annotation was computed. [2019-11-20 03:54:58,186 INFO L444 ceAbstractionStarter]: For program point L919(lines 919 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,186 INFO L444 ceAbstractionStarter]: For program point L787(lines 787 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,186 INFO L444 ceAbstractionStarter]: For program point L1184(lines 1184 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,186 INFO L444 ceAbstractionStarter]: For program point L127-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,186 INFO L444 ceAbstractionStarter]: For program point L920(lines 920 929) no Hoare annotation was computed. [2019-11-20 03:54:58,187 INFO L444 ceAbstractionStarter]: For program point L920-2(lines 920 929) no Hoare annotation was computed. [2019-11-20 03:54:58,187 INFO L444 ceAbstractionStarter]: For program point L1845(lines 1845 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,187 INFO L444 ceAbstractionStarter]: For program point L392(lines 392 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,187 INFO L444 ceAbstractionStarter]: For program point L1317(lines 1317 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,187 INFO L444 ceAbstractionStarter]: For program point L1185(lines 1185 1196) no Hoare annotation was computed. [2019-11-20 03:54:58,187 INFO L444 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-11-20 03:54:58,187 INFO L444 ceAbstractionStarter]: For program point L1185-2(lines 1185 1196) no Hoare annotation was computed. [2019-11-20 03:54:58,188 INFO L444 ceAbstractionStarter]: For program point L1582(lines 1582 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,188 INFO L444 ceAbstractionStarter]: For program point L1979(lines 1979 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,188 INFO L444 ceAbstractionStarter]: For program point L1451(lines 1451 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,188 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,188 INFO L444 ceAbstractionStarter]: For program point L2244(lines 2244 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,188 INFO L444 ceAbstractionStarter]: For program point L130-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,188 INFO L444 ceAbstractionStarter]: For program point L2509(lines 2509 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,189 INFO L444 ceAbstractionStarter]: For program point L2377(lines 2377 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,189 INFO L444 ceAbstractionStarter]: For program point L2245(lines 2245 2255) no Hoare annotation was computed. [2019-11-20 03:54:58,189 INFO L444 ceAbstractionStarter]: For program point L131(line 131) no Hoare annotation was computed. [2019-11-20 03:54:58,189 INFO L444 ceAbstractionStarter]: For program point L2245-2(lines 2245 2255) no Hoare annotation was computed. [2019-11-20 03:54:58,189 INFO L444 ceAbstractionStarter]: For program point L1056(lines 1056 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,189 INFO L444 ceAbstractionStarter]: For program point L2113(lines 2113 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,189 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 03:54:58,189 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-11-20 03:54:58,190 INFO L444 ceAbstractionStarter]: For program point L660(lines 660 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,190 INFO L444 ceAbstractionStarter]: For program point L793(lines 793 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,190 INFO L444 ceAbstractionStarter]: For program point L1718(lines 1718 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,190 INFO L444 ceAbstractionStarter]: For program point L1322(lines 1322 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,190 INFO L444 ceAbstractionStarter]: For program point L133-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,190 INFO L444 ceAbstractionStarter]: For program point L1587(lines 1587 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,190 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,191 INFO L444 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2019-11-20 03:54:58,191 INFO L444 ceAbstractionStarter]: For program point L1984(lines 1984 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,191 INFO L444 ceAbstractionStarter]: For program point L1852(lines 1852 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,191 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,191 INFO L444 ceAbstractionStarter]: For program point L532(lines 532 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,191 INFO L444 ceAbstractionStarter]: For program point L2514(lines 2514 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,191 INFO L444 ceAbstractionStarter]: For program point L1457(lines 1457 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,191 INFO L444 ceAbstractionStarter]: For program point L2382(lines 2382 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,192 INFO L444 ceAbstractionStarter]: For program point L136-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,192 INFO L444 ceAbstractionStarter]: For program point L2118(lines 2118 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,192 INFO L444 ceAbstractionStarter]: For program point L1590(lines 1590 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,192 INFO L444 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-11-20 03:54:58,192 INFO L444 ceAbstractionStarter]: For program point L930(lines 930 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,192 INFO L444 ceAbstractionStarter]: For program point L1723(lines 1723 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,192 INFO L444 ceAbstractionStarter]: For program point L1063(lines 1063 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,193 INFO L444 ceAbstractionStarter]: For program point L667(lines 667 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,193 INFO L444 ceAbstractionStarter]: For program point L535(lines 535 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,193 INFO L444 ceAbstractionStarter]: For program point L2517(lines 2517 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,193 INFO L444 ceAbstractionStarter]: For program point L1328(lines 1328 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,193 INFO L444 ceAbstractionStarter]: For program point L139-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,195 INFO L444 ceAbstractionStarter]: For program point L800(lines 800 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,195 INFO L444 ceAbstractionStarter]: For program point L1329(lines 1329 1338) no Hoare annotation was computed. [2019-11-20 03:54:58,195 INFO L444 ceAbstractionStarter]: For program point L1329-2(lines 1329 1338) no Hoare annotation was computed. [2019-11-20 03:54:58,195 INFO L444 ceAbstractionStarter]: For program point L1197(lines 1197 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,195 INFO L444 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-20 03:54:58,195 INFO L444 ceAbstractionStarter]: For program point L1858(lines 1858 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,196 INFO L444 ceAbstractionStarter]: For program point L1462(lines 1462 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,196 INFO L444 ceAbstractionStarter]: For program point L405(lines 405 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,196 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,196 INFO L444 ceAbstractionStarter]: For program point L1991(lines 1991 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,196 INFO L444 ceAbstractionStarter]: For program point L1859(lines 1859 1867) no Hoare annotation was computed. [2019-11-20 03:54:58,196 INFO L444 ceAbstractionStarter]: For program point L1859-2(lines 1859 1867) no Hoare annotation was computed. [2019-11-20 03:54:58,196 INFO L444 ceAbstractionStarter]: For program point L1595(lines 1595 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,196 INFO L444 ceAbstractionStarter]: For program point L406(lines 406 415) no Hoare annotation was computed. [2019-11-20 03:54:58,197 INFO L444 ceAbstractionStarter]: For program point L406-2(lines 406 415) no Hoare annotation was computed. [2019-11-20 03:54:58,197 INFO L444 ceAbstractionStarter]: For program point L274(lines 274 286) no Hoare annotation was computed. [2019-11-20 03:54:58,197 INFO L444 ceAbstractionStarter]: For program point L2256(lines 2256 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,197 INFO L444 ceAbstractionStarter]: For program point L274-2(lines 274 286) no Hoare annotation was computed. [2019-11-20 03:54:58,197 INFO L444 ceAbstractionStarter]: For program point L142-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,197 INFO L444 ceAbstractionStarter]: For program point L935(lines 935 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,197 INFO L444 ceAbstractionStarter]: For program point L1596(lines 1596 1607) no Hoare annotation was computed. [2019-11-20 03:54:58,198 INFO L444 ceAbstractionStarter]: For program point L1596-2(lines 1596 1607) no Hoare annotation was computed. [2019-11-20 03:54:58,198 INFO L444 ceAbstractionStarter]: For program point L2389(lines 2389 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,198 INFO L444 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-11-20 03:54:58,198 INFO L444 ceAbstractionStarter]: For program point L2125(lines 2125 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,198 INFO L444 ceAbstractionStarter]: For program point L2522(lines 2522 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,198 INFO L444 ceAbstractionStarter]: For program point L2390(lines 2390 2402) no Hoare annotation was computed. [2019-11-20 03:54:58,198 INFO L444 ceAbstractionStarter]: For program point L2390-2(lines 2390 2402) no Hoare annotation was computed. [2019-11-20 03:54:58,198 INFO L444 ceAbstractionStarter]: For program point L1069(lines 1069 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,199 INFO L444 ceAbstractionStarter]: For program point L1730(lines 1730 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,199 INFO L444 ceAbstractionStarter]: For program point L673(lines 673 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,199 INFO L444 ceAbstractionStarter]: For program point L541(lines 541 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,199 INFO L444 ceAbstractionStarter]: For program point L1202(lines 1202 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,199 INFO L444 ceAbstractionStarter]: For program point L145-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,199 INFO L444 ceAbstractionStarter]: For program point L1995(lines 1995 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,199 INFO L444 ceAbstractionStarter]: For program point L1467(lines 1467 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,200 INFO L444 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2019-11-20 03:54:58,200 INFO L444 ceAbstractionStarter]: For program point L939(lines 939 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,200 INFO L444 ceAbstractionStarter]: For program point L807(lines 807 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,200 INFO L444 ceAbstractionStarter]: For program point L2129(lines 2129 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,200 INFO L444 ceAbstractionStarter]: For program point L148-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,200 INFO L444 ceAbstractionStarter]: For program point L2527(lines 2527 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,200 INFO L444 ceAbstractionStarter]: For program point L2263(lines 2263 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,200 INFO L444 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-11-20 03:54:58,201 INFO L444 ceAbstractionStarter]: For program point L1735(lines 1735 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,201 INFO L444 ceAbstractionStarter]: For program point L2528(lines 2528 2538) no Hoare annotation was computed. [2019-11-20 03:54:58,201 INFO L444 ceAbstractionStarter]: For program point L2528-2(lines 2528 2538) no Hoare annotation was computed. [2019-11-20 03:54:58,201 INFO L444 ceAbstractionStarter]: For program point L1339(lines 1339 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,201 INFO L444 ceAbstractionStarter]: For program point L1868(lines 1868 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,201 INFO L444 ceAbstractionStarter]: For program point L679(lines 679 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,201 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,202 INFO L444 ceAbstractionStarter]: For program point L151-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,202 INFO L444 ceAbstractionStarter]: For program point L1076(lines 1076 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,202 INFO L444 ceAbstractionStarter]: For program point L548(lines 548 557) no Hoare annotation was computed. [2019-11-20 03:54:58,202 INFO L444 ceAbstractionStarter]: For program point L548-2(lines 548 557) no Hoare annotation was computed. [2019-11-20 03:54:58,202 INFO L444 ceAbstractionStarter]: For program point L416(lines 416 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,202 INFO L444 ceAbstractionStarter]: For program point L1209(lines 1209 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,202 INFO L444 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-20 03:54:58,202 INFO L444 ceAbstractionStarter]: For program point L2002(lines 2002 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,203 INFO L444 ceAbstractionStarter]: For program point L1474(lines 1474 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,203 INFO L444 ceAbstractionStarter]: For program point L2135(lines 2135 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,203 INFO L444 ceAbstractionStarter]: For program point L946(lines 946 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,203 INFO L444 ceAbstractionStarter]: For program point L814(lines 814 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,203 INFO L444 ceAbstractionStarter]: For program point L2268(lines 2268 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,203 INFO L444 ceAbstractionStarter]: For program point L154-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,203 INFO L444 ceAbstractionStarter]: For program point L1608(lines 1608 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,204 INFO L444 ceAbstractionStarter]: For program point L287(lines 287 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,204 INFO L444 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2019-11-20 03:54:58,204 INFO L444 ceAbstractionStarter]: For program point L1741(lines 1741 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,204 INFO L444 ceAbstractionStarter]: For program point L1081(lines 1081 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,204 INFO L444 ceAbstractionStarter]: For program point L1346(lines 1346 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,204 INFO L444 ceAbstractionStarter]: For program point L2403(lines 2403 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,204 INFO L444 ceAbstractionStarter]: For program point L157-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,204 INFO L444 ceAbstractionStarter]: For program point L25(lines 25 27) no Hoare annotation was computed. [2019-11-20 03:54:58,205 INFO L444 ceAbstractionStarter]: For program point L25-2(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,205 INFO L444 ceAbstractionStarter]: For program point L2007(lines 2007 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,205 INFO L444 ceAbstractionStarter]: For program point L1875(lines 1875 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,205 INFO L444 ceAbstractionStarter]: For program point L686(lines 686 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,205 INFO L444 ceAbstractionStarter]: For program point L2404(lines 2404 2415) no Hoare annotation was computed. [2019-11-20 03:54:58,205 INFO L444 ceAbstractionStarter]: For program point L2404-2(lines 2404 2415) no Hoare annotation was computed. [2019-11-20 03:54:58,205 INFO L444 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-11-20 03:54:58,206 INFO L444 ceAbstractionStarter]: For program point L2140(lines 2140 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,207 INFO L444 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2019-11-20 03:54:58,207 INFO L444 ceAbstractionStarter]: For program point L687(lines 687 697) no Hoare annotation was computed. [2019-11-20 03:54:58,207 INFO L444 ceAbstractionStarter]: For program point L687-2(lines 687 697) no Hoare annotation was computed. [2019-11-20 03:54:58,208 INFO L444 ceAbstractionStarter]: For program point L423(lines 423 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,208 INFO L444 ceAbstractionStarter]: For program point L1216(lines 1216 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,208 INFO L444 ceAbstractionStarter]: For program point L952(lines 952 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,209 INFO L444 ceAbstractionStarter]: For program point L820(lines 820 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,209 INFO L444 ceAbstractionStarter]: For program point L1745(lines 1745 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,209 INFO L444 ceAbstractionStarter]: For program point L1613(lines 1613 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,210 INFO L444 ceAbstractionStarter]: For program point L1481(lines 1481 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,210 INFO L444 ceAbstractionStarter]: For program point L160-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,210 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 03:54:58,210 INFO L444 ceAbstractionStarter]: For program point L28-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,213 INFO L444 ceAbstractionStarter]: For program point L2010(lines 2010 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,213 INFO L444 ceAbstractionStarter]: For program point L2539(lines 2539 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,213 INFO L444 ceAbstractionStarter]: For program point L2275(lines 2275 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,213 INFO L444 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2019-11-20 03:54:58,213 INFO L444 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-11-20 03:54:58,213 INFO L444 ceAbstractionStarter]: For program point L558(lines 558 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,213 INFO L444 ceAbstractionStarter]: For program point L294(lines 294 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,214 INFO L444 ceAbstractionStarter]: For program point L1352(lines 1352 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,214 INFO L444 ceAbstractionStarter]: For program point L1220(lines 1220 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,214 INFO L444 ceAbstractionStarter]: For program point L163-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,214 INFO L444 ceAbstractionStarter]: For program point L1088(lines 1088 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,214 INFO L444 ceAbstractionStarter]: For program point L2145(lines 2145 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,214 INFO L444 ceAbstractionStarter]: For program point L31-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,214 INFO L444 ceAbstractionStarter]: For program point L1881(lines 1881 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,214 INFO L444 ceAbstractionStarter]: For program point L1749(lines 1749 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,215 INFO L444 ceAbstractionStarter]: For program point L428(lines 428 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,215 INFO L444 ceAbstractionStarter]: For program point L1221(lines 1221 1230) no Hoare annotation was computed. [2019-11-20 03:54:58,215 INFO L444 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2019-11-20 03:54:58,215 INFO L444 ceAbstractionStarter]: For program point L1221-2(lines 1221 1230) no Hoare annotation was computed. [2019-11-20 03:54:58,215 INFO L444 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2019-11-20 03:54:58,215 INFO L444 ceAbstractionStarter]: For program point L826(lines 826 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,215 INFO L444 ceAbstractionStarter]: For program point L2544(lines 2544 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,215 INFO L444 ceAbstractionStarter]: For program point L1487(lines 1487 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,216 INFO L444 ceAbstractionStarter]: For program point L166-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,216 INFO L444 ceAbstractionStarter]: For program point L34-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,216 INFO L444 ceAbstractionStarter]: For program point L2016(lines 2016 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,216 INFO L444 ceAbstractionStarter]: For program point L959(lines 959 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,216 INFO L444 ceAbstractionStarter]: For program point L1620(lines 1620 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,216 INFO L444 ceAbstractionStarter]: For program point L2281(lines 2281 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,216 INFO L444 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-11-20 03:54:58,217 INFO L444 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2019-11-20 03:54:58,217 INFO L444 ceAbstractionStarter]: For program point L565(lines 565 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,217 INFO L444 ceAbstractionStarter]: For program point L1490(lines 1490 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,217 INFO L444 ceAbstractionStarter]: For program point L433(lines 433 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,217 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,217 INFO L444 ceAbstractionStarter]: For program point L169-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,217 INFO L444 ceAbstractionStarter]: For program point L1094(lines 1094 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,217 INFO L444 ceAbstractionStarter]: For program point L37-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,218 INFO L444 ceAbstractionStarter]: For program point L698(lines 698 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,218 INFO L444 ceAbstractionStarter]: For program point L2416(lines 2416 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,218 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,218 INFO L444 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-11-20 03:54:58,218 INFO L444 ceAbstractionStarter]: For program point L2152(lines 2152 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,218 INFO L444 ceAbstractionStarter]: For program point L38(line 38) no Hoare annotation was computed. [2019-11-20 03:54:58,218 INFO L444 ceAbstractionStarter]: For program point L2020(lines 2020 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,218 INFO L444 ceAbstractionStarter]: For program point L1888(lines 1888 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,219 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,219 INFO L444 ceAbstractionStarter]: For program point L1756(lines 1756 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,219 INFO L444 ceAbstractionStarter]: For program point L2021(lines 2021 2030) no Hoare annotation was computed. [2019-11-20 03:54:58,219 INFO L444 ceAbstractionStarter]: For program point L2021-2(lines 2021 2030) no Hoare annotation was computed. [2019-11-20 03:54:58,219 INFO L444 ceAbstractionStarter]: For program point L172-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,219 INFO L444 ceAbstractionStarter]: For program point L40-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,219 INFO L444 ceAbstractionStarter]: For program point L1626(lines 1626 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,219 INFO L444 ceAbstractionStarter]: For program point L2551(lines 2551 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,220 INFO L444 ceAbstractionStarter]: For program point L2287(lines 2287 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,220 INFO L444 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-11-20 03:54:58,220 INFO L444 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-11-20 03:54:58,220 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,220 INFO L444 ceAbstractionStarter]: For program point L570(lines 570 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,220 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,220 INFO L444 ceAbstractionStarter]: For program point L1231(lines 1231 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,220 INFO L444 ceAbstractionStarter]: For program point L703(lines 703 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,221 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,221 INFO L444 ceAbstractionStarter]: For program point L1364(lines 1364 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,221 INFO L444 ceAbstractionStarter]: For program point L175-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,221 INFO L444 ceAbstractionStarter]: For program point L1100(lines 1100 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,221 INFO L444 ceAbstractionStarter]: For program point L2157(lines 2157 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,221 INFO L444 ceAbstractionStarter]: For program point L43-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,221 INFO L444 ceAbstractionStarter]: For program point L1497(lines 1497 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,222 INFO L444 ceAbstractionStarter]: For program point L2422(lines 2422 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,222 INFO L444 ceAbstractionStarter]: For program point L1365(lines 1365 1376) no Hoare annotation was computed. [2019-11-20 03:54:58,222 INFO L444 ceAbstractionStarter]: For program point L1365-2(lines 1365 1376) no Hoare annotation was computed. [2019-11-20 03:54:58,222 INFO L444 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2019-11-20 03:54:58,222 INFO L444 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-11-20 03:54:58,222 INFO L444 ceAbstractionStarter]: For program point L837(lines 837 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,222 INFO L444 ceAbstractionStarter]: For program point L1895(lines 1895 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,222 INFO L444 ceAbstractionStarter]: For program point L838(lines 838 846) no Hoare annotation was computed. [2019-11-20 03:54:58,223 INFO L444 ceAbstractionStarter]: For program point L838-2(lines 838 846) no Hoare annotation was computed. [2019-11-20 03:54:58,223 INFO L444 ceAbstractionStarter]: For program point L1763(lines 1763 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,223 INFO L444 ceAbstractionStarter]: For program point L178-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,223 INFO L444 ceAbstractionStarter]: For program point L46-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,223 INFO L444 ceAbstractionStarter]: For program point L1632(lines 1632 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,223 INFO L444 ceAbstractionStarter]: For program point L2557(lines 2557 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,223 INFO L444 ceAbstractionStarter]: For program point L2293(lines 2293 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,223 INFO L444 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2019-11-20 03:54:58,224 INFO L444 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-11-20 03:54:58,224 INFO L444 ceAbstractionStarter]: For program point L972(lines 972 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,224 INFO L444 ceAbstractionStarter]: For program point L576(lines 576 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,224 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,224 INFO L444 ceAbstractionStarter]: For program point L709(lines 709 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,224 INFO L444 ceAbstractionStarter]: For program point L313(lines 313 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,224 INFO L444 ceAbstractionStarter]: For program point L181-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,224 INFO L444 ceAbstractionStarter]: For program point L1106(lines 1106 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,225 INFO L444 ceAbstractionStarter]: For program point L2163(lines 2163 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,225 INFO L444 ceAbstractionStarter]: For program point L49-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,225 INFO L444 ceAbstractionStarter]: For program point L2031(lines 2031 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,225 INFO L444 ceAbstractionStarter]: For program point L710(lines 710 718) no Hoare annotation was computed. [2019-11-20 03:54:58,225 INFO L444 ceAbstractionStarter]: For program point L710-2(lines 710 718) no Hoare annotation was computed. [2019-11-20 03:54:58,225 INFO L444 ceAbstractionStarter]: For program point L446(lines 446 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,225 INFO L444 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-11-20 03:54:58,225 INFO L444 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-11-20 03:54:58,226 INFO L444 ceAbstractionStarter]: For program point L975(lines 975 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,226 INFO L444 ceAbstractionStarter]: For program point L1900(lines 1900 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,226 INFO L444 ceAbstractionStarter]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,226 INFO L444 ceAbstractionStarter]: For program point L1504(lines 1504 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,226 INFO L444 ceAbstractionStarter]: For program point L2429(lines 2429 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,226 INFO L444 ceAbstractionStarter]: For program point L2297(lines 2297 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,226 INFO L444 ceAbstractionStarter]: For program point L2430(lines 2430 2439) no Hoare annotation was computed. [2019-11-20 03:54:58,226 INFO L444 ceAbstractionStarter]: For program point L2430-2(lines 2430 2439) no Hoare annotation was computed. [2019-11-20 03:54:58,227 INFO L444 ceAbstractionStarter]: For program point L184-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,227 INFO L444 ceAbstractionStarter]: For program point L52-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,227 INFO L444 ceAbstractionStarter]: For program point L1770(lines 1770 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,227 INFO L444 ceAbstractionStarter]: For program point L2563(lines 2563 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,227 INFO L444 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2019-11-20 03:54:58,227 INFO L444 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2019-11-20 03:54:58,227 INFO L444 ceAbstractionStarter]: For program point L582(lines 582 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,227 INFO L444 ceAbstractionStarter]: For program point L2168(lines 2168 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,228 INFO L444 ceAbstractionStarter]: For program point L847(lines 847 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,228 INFO L444 ceAbstractionStarter]: For program point L451(lines 451 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,228 INFO L444 ceAbstractionStarter]: For program point L319(lines 319 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,228 INFO L444 ceAbstractionStarter]: For program point L1244(lines 1244 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,228 INFO L444 ceAbstractionStarter]: For program point L187-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,228 INFO L444 ceAbstractionStarter]: For program point L55-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,228 INFO L444 ceAbstractionStarter]: For program point L848(lines 848 858) no Hoare annotation was computed. [2019-11-20 03:54:58,228 INFO L444 ceAbstractionStarter]: For program point L848-2(lines 848 858) no Hoare annotation was computed. [2019-11-20 03:54:58,229 INFO L444 ceAbstractionStarter]: For program point L1377(lines 1377 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,229 INFO L444 ceAbstractionStarter]: For program point L2302(lines 2302 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,229 INFO L444 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-11-20 03:54:58,231 INFO L444 ceAbstractionStarter]: For program point L1113(lines 1113 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,232 INFO L444 ceAbstractionStarter]: For program point L56(line 56) no Hoare annotation was computed. [2019-11-20 03:54:58,232 INFO L444 ceAbstractionStarter]: For program point L2038(lines 2038 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,232 INFO L444 ceAbstractionStarter]: For program point L981(lines 981 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,232 INFO L444 ceAbstractionStarter]: For program point L1906(lines 1906 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,232 INFO L444 ceAbstractionStarter]: For program point L1510(lines 1510 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,232 INFO L444 ceAbstractionStarter]: For program point L1907(lines 1907 1915) no Hoare annotation was computed. [2019-11-20 03:54:58,232 INFO L444 ceAbstractionStarter]: For program point L1907-2(lines 1907 1915) no Hoare annotation was computed. [2019-11-20 03:54:58,233 INFO L440 ceAbstractionStarter]: At program point L1643(lines 24 1644) the Hoare annotation is: (let ((.cse40 (+ ~a14~0 114)) (.cse37 (+ ~a26~0 68))) (let ((.cse18 (< 217 ~a26~0)) (.cse19 (= ~a24~0 1)) (.cse39 (+ ~a14~0 182)) (.cse7 (< 300 ~a28~0)) (.cse0 (= ~a24~0 2)) (.cse36 (+ ~a14~0 84)) (.cse25 (<= .cse37 0)) (.cse21 (< 0 .cse40)) (.cse3 (<= ~a21~0 124))) (let ((.cse11 (and .cse25 .cse21 .cse3)) (.cse10 (<= (+ ~a26~0 10118) 0)) (.cse20 (< 0 .cse36)) (.cse6 (<= ~a26~0 215)) (.cse23 (<= 0 (+ ~a14~0 82))) (.cse27 (exists ((v_~a26~0_1234 Int)) (and (<= v_~a26~0_1234 217) (<= ~a26~0 (div (+ v_~a26~0_1234 308146) 5)) (< 124 v_~a26~0_1234) (= 0 (mod (+ v_~a26~0_1234 1) 5))))) (.cse14 (< 124 ~a26~0)) (.cse8 (not .cse0)) (.cse26 (and .cse7 .cse0)) (.cse17 (and .cse25 .cse3)) (.cse13 (exists ((v_~a28~0_1305 Int)) (and (< 37 v_~a28~0_1305) (<= 0 v_~a28~0_1305) (<= (+ (mod v_~a28~0_1305 299849) 18943) ~a28~0)))) (.cse16 (<= ~a28~0 300)) (.cse32 (<= 0 (+ ~a26~0 12))) (.cse4 (<= .cse39 0)) (.cse33 (or (and .cse7 .cse19) (and .cse18 .cse19))) (.cse22 (< 37 ~a28~0)) (.cse31 (<= (div (+ (- ~a26~0) 596057) (- 5)) 124)) (.cse1 (<= ~a28~0 134)) (.cse2 (<= ~a26~0 217)) (.cse5 (<= .cse40 0)) (.cse9 (< 0 .cse39)) (.cse35 (<= ~a28~0 279)) (.cse15 (exists ((v_~a28~0_1307 Int)) (let ((.cse38 (mod (+ v_~a28~0_1307 6) 82))) (and (not (= .cse38 0)) (<= (+ .cse38 137) ~a28~0) (< v_~a28~0_1307 89948))))) (.cse34 (< 0 .cse37)) (.cse30 (<= (+ ~a14~0 4163) 0)) (.cse24 (<= ~a26~0 124)) (.cse28 (<= ~a26~0 599998)) (.cse29 (and .cse18 .cse0 .cse21)) (.cse12 (<= .cse36 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse3 .cse7 .cse8 .cse9) (and (and .cse10 .cse11) .cse12) (and .cse0 .cse13 .cse3 (<= ~a26~0 590083) .cse4) (and .cse14 .cse0 .cse6 .cse15 .cse3 .cse16) (and (and .cse16 .cse0 .cse17) .cse15) (and .cse18 .cse0 .cse15 .cse3 .cse16 (<= ~a26~0 449816)) (and (and (and .cse19 .cse2) .cse3) .cse20) (and .cse0 (and .cse14 .cse2 .cse21 .cse3) .cse12) (and .cse22 (and .cse11 .cse12)) (and .cse0 .cse23 .cse24 .cse3) (and (and .cse16 (and .cse10 .cse0 .cse3)) .cse22) (and (and .cse25 .cse8 .cse3) .cse9) (and (and .cse14 .cse26 .cse3 .cse27) .cse4) (and .cse28 .cse23 .cse29 .cse3) (and (and (and .cse18 .cse19 .cse3) (<= ~a26~0 460652)) .cse15) (and (and .cse25 (<= (+ ~a28~0 599901) 0) .cse3) .cse30) (and (and .cse14 .cse0 .cse20 .cse6 .cse3) .cse15) (and .cse28 (and .cse0 .cse1 .cse3 .cse22 .cse4)) (and .cse18 .cse0 .cse31 .cse3 .cse16 .cse22 .cse4) (and .cse0 .cse1 .cse31 .cse30 .cse3) (and .cse23 (= ~a28~0 111) .cse3 .cse27 .cse19) (and (and (and .cse21 .cse26 .cse3) .cse32) .cse24) (and .cse14 .cse0 .cse2 .cse3 .cse16 .cse21 .cse22) (and .cse33 .cse12) (and .cse1 .cse5 .cse2 .cse3 .cse8 .cse9) (and .cse13 (and (exists ((v_~a26~0_1226 Int)) (and (<= ~a26~0 (+ (div v_~a26~0_1226 5) 460627)) (<= v_~a26~0_1226 124) (<= 0 v_~a26~0_1226))) .cse26) .cse3) (and (and (and .cse0 .cse21 .cse3) .cse34 .cse12) .cse24) (and .cse18 .cse0 .cse31 (<= (+ ~a14~0 85) 0) .cse3 .cse9) (and .cse1 .cse8 .cse5 .cse9 .cse22 .cse3) (and (<= ~a26~0 321684) .cse18 .cse0 .cse3 .cse22 .cse4) (and (and .cse25 (and .cse26 .cse3)) .cse4) (or (and .cse17 .cse13 (<= (+ ~a26~0 150557) ~a28~0)) (and .cse7 (<= (+ ~a26~0 139421) 0) .cse4 .cse3)) (and (and (and .cse16 .cse5 .cse3) .cse0 .cse9 .cse22 .cse32) .cse2) (and .cse2 .cse15 (and .cse0 .cse35 .cse4 .cse3)) (and .cse19 (or .cse5 .cse24)) (and .cse7 (exists ((v_~a26~0_1243 Int)) (and (<= (div (+ (* v_~a26~0_1243 (- 1)) 596057) (- 5)) 124) (<= (+ ~a26~0 600073) v_~a26~0_1243))) .cse30 .cse3) (and .cse33 .cse2) (and .cse1 .cse0 .cse22 .cse31 .cse3) (and .cse1 .cse19 .cse2) (and (and .cse34 .cse3 .cse5 .cse9) .cse24) (and .cse35 .cse15 .cse34 .cse30 .cse3 .cse24) (and .cse28 .cse29 .cse12 .cse3))))) [2019-11-20 03:54:58,234 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 03:54:58,234 INFO L444 ceAbstractionStarter]: For program point L190-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,234 INFO L444 ceAbstractionStarter]: For program point L2172(lines 2172 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,234 INFO L444 ceAbstractionStarter]: For program point L58-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,234 INFO L444 ceAbstractionStarter]: For program point L719(lines 719 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,234 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,234 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,234 INFO L444 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2019-11-20 03:54:58,234 INFO L444 ceAbstractionStarter]: For program point L59(line 59) no Hoare annotation was computed. [2019-11-20 03:54:58,234 INFO L444 ceAbstractionStarter]: For program point L1777(lines 1777 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,234 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,235 INFO L440 ceAbstractionStarter]: At program point L2571(lines 1646 2572) the Hoare annotation is: (let ((.cse41 (+ ~a26~0 68)) (.cse42 (+ ~a14~0 84)) (.cse40 (+ ~a14~0 114))) (let ((.cse23 (< 217 ~a26~0)) (.cse24 (= ~a24~0 1)) (.cse39 (+ ~a14~0 182)) (.cse20 (<= ~a28~0 300)) (.cse9 (<= .cse40 0)) (.cse25 (< 0 .cse42)) (.cse26 (< 37 ~a28~0)) (.cse16 (<= .cse42 0)) (.cse27 (< 0 .cse41)) (.cse11 (< 300 ~a28~0)) (.cse0 (= ~a24~0 2)) (.cse5 (<= .cse41 0)) (.cse6 (< 0 .cse40)) (.cse3 (<= ~a21~0 124))) (let ((.cse15 (and .cse5 .cse6 .cse3)) (.cse21 (<= ~a26~0 449816)) (.cse14 (<= (+ ~a26~0 10118) 0)) (.cse10 (<= ~a26~0 215)) (.cse31 (exists ((v_~a26~0_1234 Int)) (and (<= v_~a26~0_1234 217) (<= ~a26~0 (div (+ v_~a26~0_1234 308146) 5)) (< 124 v_~a26~0_1234) (= 0 (mod (+ v_~a26~0_1234 1) 5))))) (.cse18 (< 124 ~a26~0)) (.cse8 (<= (+ ~a14~0 85) 0)) (.cse12 (not .cse0)) (.cse7 (and .cse11 .cse0)) (.cse28 (<= 0 (+ ~a14~0 82))) (.cse22 (or (and (or .cse20 .cse9 .cse25) (or .cse26 .cse16)) (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse27)) (.cse17 (exists ((v_~a28~0_1305 Int)) (and (< 37 v_~a28~0_1305) (<= 0 v_~a28~0_1305) (<= (+ (mod v_~a28~0_1305 299849) 18943) ~a28~0)))) (.cse4 (<= .cse39 0)) (.cse36 (<= 0 (+ ~a26~0 12))) (.cse37 (or (and .cse11 .cse24) (and .cse23 .cse24))) (.cse35 (<= (div (+ (- ~a26~0) 596057) (- 5)) 124)) (.cse1 (<= ~a28~0 134)) (.cse2 (<= ~a26~0 217)) (.cse13 (< 0 .cse39)) (.cse30 (<= ~a28~0 279)) (.cse19 (exists ((v_~a28~0_1307 Int)) (let ((.cse38 (mod (+ v_~a28~0_1307 6) 82))) (and (not (= .cse38 0)) (<= (+ .cse38 137) ~a28~0) (< v_~a28~0_1307 89948))))) (.cse34 (<= (+ ~a14~0 4163) 0)) (.cse29 (<= ~a26~0 124)) (.cse32 (<= ~a26~0 599998)) (.cse33 (and .cse23 .cse0 .cse6))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse3) (and .cse9 .cse10 .cse3 .cse11 .cse12 .cse13) (and (and .cse14 .cse15) .cse16) (and .cse0 .cse17 .cse3 (<= ~a26~0 590083) .cse4) (and .cse18 .cse0 .cse10 .cse19 .cse3 .cse20) (and (and .cse21 .cse22 .cse6 .cse7 .cse3) .cse16) (and (and .cse20 .cse0 (and .cse5 .cse3)) .cse19) (and .cse23 .cse0 .cse19 .cse3 .cse20 .cse21) (and (and (and .cse24 .cse2) .cse3) .cse25) (and .cse0 (and .cse18 .cse2 .cse6 .cse3) .cse16) (and .cse20 .cse26 (and .cse15 .cse16)) (and .cse27 (and .cse0 .cse28 .cse29 .cse3)) (and (and .cse0 .cse21 .cse30 .cse4 .cse3) .cse19) (and (and .cse20 (and .cse14 .cse0 .cse3)) .cse26) (and (and .cse5 .cse12 .cse3) .cse13) (and (and .cse18 .cse7 .cse3 .cse31) .cse4) (and .cse32 .cse28 .cse33 .cse3) (and (and (and .cse23 .cse24 .cse3) (<= ~a26~0 460652)) .cse19) (and (and .cse5 (<= (+ ~a28~0 599901) 0) .cse3) .cse34) (and (and .cse18 .cse0 .cse25 .cse10 .cse3) .cse19) (and .cse32 (and .cse0 .cse1 .cse3 .cse26 .cse4)) (and .cse23 .cse0 .cse35 .cse3 .cse20 .cse26 .cse4) (and .cse0 .cse1 .cse35 .cse34 .cse3) (and .cse28 (= ~a28~0 111) .cse3 .cse31 .cse24) (and (and (and .cse25 .cse7 .cse3) .cse36) .cse29) (and .cse18 .cse0 .cse2 .cse3 .cse20 .cse6 .cse26) (and .cse37 .cse16) (and .cse1 .cse9 .cse2 .cse3 .cse12 .cse13) (and (and (and .cse0 .cse6 .cse3) .cse27 .cse16) .cse29) (and .cse23 .cse0 .cse35 .cse8 .cse3 .cse13) (and .cse1 .cse12 .cse9 .cse13 .cse26 .cse3) (and .cse17 .cse3 (or .cse9 .cse25) (and (exists ((v_~a26~0_1226 Int)) (and (<= ~a26~0 (+ (div v_~a26~0_1226 5) 460627)) (<= v_~a26~0_1226 124) (<= 0 v_~a26~0_1226))) .cse7)) (and (<= ~a26~0 321684) .cse23 .cse0 .cse3 .cse26 .cse4) (and (and .cse5 (and .cse7 .cse3)) .cse4) (and (and .cse5 .cse28 .cse3) .cse22) (or (and (and .cse5 .cse9 .cse3) .cse17 (<= (+ ~a26~0 150557) ~a28~0)) (and .cse11 (<= (+ ~a26~0 139421) 0) .cse4 .cse3)) (and (and (and .cse20 .cse9 .cse3) .cse0 .cse13 .cse26 .cse36) .cse2) (and .cse24 (or .cse9 .cse29)) (and .cse11 (exists ((v_~a26~0_1243 Int)) (and (<= (div (+ (* v_~a26~0_1243 (- 1)) 596057) (- 5)) 124) (<= (+ ~a26~0 600073) v_~a26~0_1243))) .cse34 .cse3) (and .cse37 .cse2) (and .cse1 .cse0 .cse26 .cse35 .cse3) (and .cse1 .cse24 .cse2) (and (and .cse27 .cse3 .cse9 .cse13) .cse29) (and .cse30 .cse19 .cse27 .cse34 .cse3 .cse29) (and .cse32 .cse33 .cse16 .cse3))))) [2019-11-20 03:54:58,235 INFO L444 ceAbstractionStarter]: For program point L2307(lines 2307 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,235 INFO L444 ceAbstractionStarter]: For program point L193-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,235 INFO L444 ceAbstractionStarter]: For program point L61-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,235 INFO L444 ceAbstractionStarter]: For program point L2043(lines 2043 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,235 INFO L444 ceAbstractionStarter]: For program point L1515(lines 1515 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,235 INFO L444 ceAbstractionStarter]: For program point L458(lines 458 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,235 INFO L444 ceAbstractionStarter]: For program point L2440(lines 2440 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,235 INFO L444 ceAbstractionStarter]: For program point L1383(lines 1383 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,235 INFO L444 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2019-11-20 03:54:58,235 INFO L444 ceAbstractionStarter]: For program point L1119(lines 1119 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,235 INFO L444 ceAbstractionStarter]: For program point L62(line 62) no Hoare annotation was computed. [2019-11-20 03:54:58,235 INFO L444 ceAbstractionStarter]: For program point L988(lines 988 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,236 INFO L444 ceAbstractionStarter]: For program point L1649(lines 1649 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,236 INFO L447 ceAbstractionStarter]: At program point L2574(lines 2574 2590) the Hoare annotation is: true [2019-11-20 03:54:58,236 INFO L444 ceAbstractionStarter]: For program point L196-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,236 INFO L444 ceAbstractionStarter]: For program point L2178(lines 2178 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,236 INFO L444 ceAbstractionStarter]: For program point L64-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,236 INFO L444 ceAbstractionStarter]: For program point L725(lines 725 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,236 INFO L444 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-11-20 03:54:58,236 INFO L444 ceAbstractionStarter]: For program point L65(line 65) no Hoare annotation was computed. [2019-11-20 03:54:58,237 INFO L444 ceAbstractionStarter]: For program point L726(lines 726 736) no Hoare annotation was computed. [2019-11-20 03:54:58,237 INFO L444 ceAbstractionStarter]: For program point L726-2(lines 726 736) no Hoare annotation was computed. [2019-11-20 03:54:58,237 INFO L444 ceAbstractionStarter]: For program point L594(lines 594 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,237 INFO L444 ceAbstractionStarter]: For program point L330(lines 330 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,237 INFO L444 ceAbstractionStarter]: For program point L1255(lines 1255 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,237 INFO L444 ceAbstractionStarter]: For program point L1916(lines 1916 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,237 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,237 INFO L444 ceAbstractionStarter]: For program point L1784(lines 1784 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,238 INFO L444 ceAbstractionStarter]: For program point L463(lines 463 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,238 INFO L444 ceAbstractionStarter]: For program point L2313(lines 2313 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,238 INFO L444 ceAbstractionStarter]: For program point L199-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,238 INFO L444 ceAbstractionStarter]: For program point L67-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,238 INFO L444 ceAbstractionStarter]: For program point L1521(lines 1521 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,240 INFO L444 ceAbstractionStarter]: For program point L2446(lines 2446 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,240 INFO L444 ceAbstractionStarter]: For program point L1389(lines 1389 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,240 INFO L444 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-11-20 03:54:58,241 INFO L444 ceAbstractionStarter]: For program point L1125(lines 1125 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,244 INFO L444 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-20 03:54:58,244 INFO L444 ceAbstractionStarter]: For program point L2050(lines 2050 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,244 INFO L444 ceAbstractionStarter]: For program point L1654(lines 1654 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,245 INFO L440 ceAbstractionStarter]: At program point L2580-2(lines 2580 2589) the Hoare annotation is: (let ((.cse40 (+ ~a14~0 114)) (.cse37 (+ ~a26~0 68))) (let ((.cse18 (< 217 ~a26~0)) (.cse19 (= ~a24~0 1)) (.cse39 (+ ~a14~0 182)) (.cse7 (< 300 ~a28~0)) (.cse0 (= ~a24~0 2)) (.cse36 (+ ~a14~0 84)) (.cse25 (<= .cse37 0)) (.cse21 (< 0 .cse40)) (.cse3 (<= ~a21~0 124))) (let ((.cse11 (and .cse25 .cse21 .cse3)) (.cse10 (<= (+ ~a26~0 10118) 0)) (.cse20 (< 0 .cse36)) (.cse6 (<= ~a26~0 215)) (.cse23 (<= 0 (+ ~a14~0 82))) (.cse27 (exists ((v_~a26~0_1234 Int)) (and (<= v_~a26~0_1234 217) (<= ~a26~0 (div (+ v_~a26~0_1234 308146) 5)) (< 124 v_~a26~0_1234) (= 0 (mod (+ v_~a26~0_1234 1) 5))))) (.cse14 (< 124 ~a26~0)) (.cse8 (not .cse0)) (.cse26 (and .cse7 .cse0)) (.cse17 (and .cse25 .cse3)) (.cse13 (exists ((v_~a28~0_1305 Int)) (and (< 37 v_~a28~0_1305) (<= 0 v_~a28~0_1305) (<= (+ (mod v_~a28~0_1305 299849) 18943) ~a28~0)))) (.cse16 (<= ~a28~0 300)) (.cse32 (<= 0 (+ ~a26~0 12))) (.cse4 (<= .cse39 0)) (.cse33 (or (and .cse7 .cse19) (and .cse18 .cse19))) (.cse22 (< 37 ~a28~0)) (.cse31 (<= (div (+ (- ~a26~0) 596057) (- 5)) 124)) (.cse1 (<= ~a28~0 134)) (.cse2 (<= ~a26~0 217)) (.cse5 (<= .cse40 0)) (.cse9 (< 0 .cse39)) (.cse35 (<= ~a28~0 279)) (.cse15 (exists ((v_~a28~0_1307 Int)) (let ((.cse38 (mod (+ v_~a28~0_1307 6) 82))) (and (not (= .cse38 0)) (<= (+ .cse38 137) ~a28~0) (< v_~a28~0_1307 89948))))) (.cse34 (< 0 .cse37)) (.cse30 (<= (+ ~a14~0 4163) 0)) (.cse24 (<= ~a26~0 124)) (.cse28 (<= ~a26~0 599998)) (.cse29 (and .cse18 .cse0 .cse21)) (.cse12 (<= .cse36 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse3 .cse7 .cse8 .cse9) (and (and .cse10 .cse11) .cse12) (and .cse0 .cse13 .cse3 (<= ~a26~0 590083) .cse4) (and .cse14 .cse0 .cse6 .cse15 .cse3 .cse16) (and (and .cse16 .cse0 .cse17) .cse15) (and .cse18 .cse0 .cse15 .cse3 .cse16 (<= ~a26~0 449816)) (and (and (and .cse19 .cse2) .cse3) .cse20) (and .cse0 (and .cse14 .cse2 .cse21 .cse3) .cse12) (and .cse22 (and .cse11 .cse12)) (and .cse0 .cse23 .cse24 .cse3) (and (and .cse16 (and .cse10 .cse0 .cse3)) .cse22) (and (and .cse25 .cse8 .cse3) .cse9) (and (and .cse14 .cse26 .cse3 .cse27) .cse4) (and .cse28 .cse23 .cse29 .cse3) (and (and (and .cse18 .cse19 .cse3) (<= ~a26~0 460652)) .cse15) (and (and .cse25 (<= (+ ~a28~0 599901) 0) .cse3) .cse30) (and (and .cse14 .cse0 .cse20 .cse6 .cse3) .cse15) (and .cse28 (and .cse0 .cse1 .cse3 .cse22 .cse4)) (and .cse18 .cse0 .cse31 .cse3 .cse16 .cse22 .cse4) (and .cse0 .cse1 .cse31 .cse30 .cse3) (and .cse23 (= ~a28~0 111) .cse3 .cse27 .cse19) (and (and (and .cse21 .cse26 .cse3) .cse32) .cse24) (and .cse14 .cse0 .cse2 .cse3 .cse16 .cse21 .cse22) (and .cse33 .cse12) (and .cse1 .cse5 .cse2 .cse3 .cse8 .cse9) (and .cse13 (and (exists ((v_~a26~0_1226 Int)) (and (<= ~a26~0 (+ (div v_~a26~0_1226 5) 460627)) (<= v_~a26~0_1226 124) (<= 0 v_~a26~0_1226))) .cse26) .cse3) (and (and (and .cse0 .cse21 .cse3) .cse34 .cse12) .cse24) (and .cse18 .cse0 .cse31 (<= (+ ~a14~0 85) 0) .cse3 .cse9) (and .cse1 .cse8 .cse5 .cse9 .cse22 .cse3) (and (<= ~a26~0 321684) .cse18 .cse0 .cse3 .cse22 .cse4) (and (and .cse25 (and .cse26 .cse3)) .cse4) (or (and .cse17 .cse13 (<= (+ ~a26~0 150557) ~a28~0)) (and .cse7 (<= (+ ~a26~0 139421) 0) .cse4 .cse3)) (and (and (and .cse16 .cse5 .cse3) .cse0 .cse9 .cse22 .cse32) .cse2) (and .cse2 .cse15 (and .cse0 .cse35 .cse4 .cse3)) (and .cse19 (or .cse5 .cse24)) (and .cse7 (exists ((v_~a26~0_1243 Int)) (and (<= (div (+ (* v_~a26~0_1243 (- 1)) 596057) (- 5)) 124) (<= (+ ~a26~0 600073) v_~a26~0_1243))) .cse30 .cse3) (and .cse33 .cse2) (and .cse1 .cse0 .cse22 .cse31 .cse3) (and .cse1 .cse19 .cse2) (and (and .cse34 .cse3 .cse5 .cse9) .cse24) (and .cse35 .cse15 .cse34 .cse30 .cse3 .cse24) (and .cse28 .cse29 .cse12 .cse3))))) [2019-11-20 03:54:58,245 INFO L444 ceAbstractionStarter]: For program point L202-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,246 INFO L444 ceAbstractionStarter]: For program point L70-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,246 INFO L444 ceAbstractionStarter]: For program point L995(lines 995 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,246 INFO L444 ceAbstractionStarter]: For program point L599(lines 599 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,246 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,246 INFO L444 ceAbstractionStarter]: For program point L2317(lines 2317 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,246 INFO L444 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-11-20 03:54:58,246 INFO L444 ceAbstractionStarter]: For program point L2185(lines 2185 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,247 INFO L444 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-11-20 03:54:58,247 INFO L444 ceAbstractionStarter]: For program point L600(lines 600 605) no Hoare annotation was computed. [2019-11-20 03:54:58,247 INFO L444 ceAbstractionStarter]: For program point L600-2(lines 600 605) no Hoare annotation was computed. [2019-11-20 03:54:58,247 INFO L444 ceAbstractionStarter]: For program point L1525(lines 1525 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,247 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,247 INFO L444 ceAbstractionStarter]: For program point L2318(lines 2318 2329) no Hoare annotation was computed. [2019-11-20 03:54:58,247 INFO L444 ceAbstractionStarter]: For program point L2318-2(lines 2318 2329) no Hoare annotation was computed. [2019-11-20 03:54:58,247 INFO L444 ceAbstractionStarter]: For program point L2186(lines 2186 2196) no Hoare annotation was computed. [2019-11-20 03:54:58,247 INFO L444 ceAbstractionStarter]: For program point L2186-2(lines 2186 2196) no Hoare annotation was computed. [2019-11-20 03:54:58,248 INFO L444 ceAbstractionStarter]: For program point L1922(lines 1922 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,248 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,248 INFO L444 ceAbstractionStarter]: For program point L1262(lines 1262 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,248 INFO L444 ceAbstractionStarter]: For program point L205-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,248 INFO L444 ceAbstractionStarter]: For program point L1130(lines 1130 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,248 INFO L444 ceAbstractionStarter]: For program point L73-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,248 INFO L444 ceAbstractionStarter]: For program point L1791(lines 1791 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,248 INFO L444 ceAbstractionStarter]: For program point L1659(lines 1659 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,248 INFO L444 ceAbstractionStarter]: For program point L1395(lines 1395 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,248 INFO L444 ceAbstractionStarter]: For program point L206(line 206) no Hoare annotation was computed. [2019-11-20 03:54:58,248 INFO L444 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-11-20 03:54:58,248 INFO L444 ceAbstractionStarter]: For program point L999(lines 999 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,248 INFO L444 ceAbstractionStarter]: For program point L1792(lines 1792 1800) no Hoare annotation was computed. [2019-11-20 03:54:58,248 INFO L444 ceAbstractionStarter]: For program point L1792-2(lines 1792 1800) no Hoare annotation was computed. [2019-11-20 03:54:58,248 INFO L444 ceAbstractionStarter]: For program point L2585(line 2585) no Hoare annotation was computed. [2019-11-20 03:54:58,248 INFO L444 ceAbstractionStarter]: For program point L1396(lines 1396 1405) no Hoare annotation was computed. [2019-11-20 03:54:58,249 INFO L444 ceAbstractionStarter]: For program point L2453(lines 2453 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,249 INFO L444 ceAbstractionStarter]: For program point L1396-2(lines 1396 1405) no Hoare annotation was computed. [2019-11-20 03:54:58,249 INFO L444 ceAbstractionStarter]: For program point L2057(lines 2057 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,249 INFO L444 ceAbstractionStarter]: For program point L76-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,249 INFO L444 ceAbstractionStarter]: For program point L737(lines 737 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,249 INFO L444 ceAbstractionStarter]: For program point L77(line 77) no Hoare annotation was computed. [2019-11-20 03:54:58,249 INFO L444 ceAbstractionStarter]: For program point L1927(lines 1927 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,249 INFO L444 ceAbstractionStarter]: For program point L1663(lines 1663 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,249 INFO L444 ceAbstractionStarter]: For program point L606(lines 606 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,249 INFO L444 ceAbstractionStarter]: For program point L1531(lines 1531 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,249 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,249 INFO L444 ceAbstractionStarter]: For program point L1267(lines 1267 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,249 INFO L444 ceAbstractionStarter]: For program point L1135(lines 1135 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,249 INFO L444 ceAbstractionStarter]: For program point L871(lines 871 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,249 INFO L444 ceAbstractionStarter]: For program point L607(lines 607 617) no Hoare annotation was computed. [2019-11-20 03:54:58,249 INFO L444 ceAbstractionStarter]: For program point L607-2(lines 607 617) no Hoare annotation was computed. [2019-11-20 03:54:58,249 INFO L444 ceAbstractionStarter]: For program point L475(lines 475 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,250 INFO L444 ceAbstractionStarter]: For program point L79-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,250 INFO L444 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-20 03:54:58,250 INFO L444 ceAbstractionStarter]: For program point L1005(lines 1005 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,250 INFO L444 ceAbstractionStarter]: For program point L2063(lines 2063 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,250 INFO L444 ceAbstractionStarter]: For program point L874(lines 874 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,250 INFO L444 ceAbstractionStarter]: For program point L742(lines 742 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,250 INFO L444 ceAbstractionStarter]: For program point L2460(lines 2460 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,250 INFO L444 ceAbstractionStarter]: For program point L82-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,250 INFO L444 ceAbstractionStarter]: For program point L1932(lines 1932 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,250 INFO L444 ceAbstractionStarter]: For program point L479(lines 479 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,250 INFO L444 ceAbstractionStarter]: For program point L347(lines 347 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,250 INFO L444 ceAbstractionStarter]: For program point L1272(lines 1272 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,250 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,250 INFO L444 ceAbstractionStarter]: For program point L2197(lines 2197 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,250 INFO L444 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-11-20 03:54:58,250 INFO L444 ceAbstractionStarter]: For program point L1933(lines 1933 1944) no Hoare annotation was computed. [2019-11-20 03:54:58,250 INFO L444 ceAbstractionStarter]: For program point L1933-2(lines 1933 1944) no Hoare annotation was computed. [2019-11-20 03:54:58,250 INFO L444 ceAbstractionStarter]: For program point L1801(lines 1801 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,251 INFO L444 ceAbstractionStarter]: For program point L2330(lines 2330 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,251 INFO L444 ceAbstractionStarter]: For program point L1670(lines 1670 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,251 INFO L444 ceAbstractionStarter]: For program point L1538(lines 1538 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,251 INFO L444 ceAbstractionStarter]: For program point L1406(lines 1406 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,251 INFO L444 ceAbstractionStarter]: For program point L1142(lines 1142 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,251 INFO L444 ceAbstractionStarter]: For program point L85-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,251 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 03:54:58,251 INFO L444 ceAbstractionStarter]: For program point L86(line 86) no Hoare annotation was computed. [2019-11-20 03:54:58,251 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,251 INFO L444 ceAbstractionStarter]: For program point L2069(lines 2069 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,251 INFO L444 ceAbstractionStarter]: For program point L880(lines 880 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,251 INFO L444 ceAbstractionStarter]: For program point L748(lines 748 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,251 INFO L444 ceAbstractionStarter]: For program point L2334(lines 2334 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,251 INFO L444 ceAbstractionStarter]: For program point L1145(lines 1145 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,251 INFO L444 ceAbstractionStarter]: For program point L88-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,251 INFO L444 ceAbstractionStarter]: For program point L749(lines 749 760) no Hoare annotation was computed. [2019-11-20 03:54:58,251 INFO L444 ceAbstractionStarter]: For program point L749-2(lines 749 760) no Hoare annotation was computed. [2019-11-20 03:54:58,252 INFO L444 ceAbstractionStarter]: For program point L2467(lines 2467 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,252 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,252 INFO L444 ceAbstractionStarter]: For program point L2203(lines 2203 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,252 INFO L444 ceAbstractionStarter]: For program point L89(line 89) no Hoare annotation was computed. [2019-11-20 03:54:58,252 INFO L444 ceAbstractionStarter]: For program point L1807(lines 1807 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,252 INFO L444 ceAbstractionStarter]: For program point L618(lines 618 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,252 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,252 INFO L444 ceAbstractionStarter]: For program point L1279(lines 1279 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,252 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,252 INFO L444 ceAbstractionStarter]: For program point L91-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,252 INFO L444 ceAbstractionStarter]: For program point L1016(lines 1016 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,252 INFO L444 ceAbstractionStarter]: For program point L884(lines 884 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,252 INFO L444 ceAbstractionStarter]: For program point L1677(lines 1677 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,252 INFO L444 ceAbstractionStarter]: For program point L1545(lines 1545 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,252 INFO L444 ceAbstractionStarter]: For program point L1413(lines 1413 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,252 INFO L444 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-11-20 03:54:58,252 INFO L444 ceAbstractionStarter]: For program point L2074(lines 2074 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,253 INFO L444 ceAbstractionStarter]: For program point L1017(lines 1017 1027) no Hoare annotation was computed. [2019-11-20 03:54:58,253 INFO L444 ceAbstractionStarter]: For program point L1017-2(lines 1017 1027) no Hoare annotation was computed. [2019-11-20 03:54:58,253 INFO L444 ceAbstractionStarter]: For program point L1546(lines 1546 1550) no Hoare annotation was computed. [2019-11-20 03:54:58,253 INFO L444 ceAbstractionStarter]: For program point L1546-2(lines 1546 1550) no Hoare annotation was computed. [2019-11-20 03:54:58,253 INFO L444 ceAbstractionStarter]: For program point L1414(lines 1414 1423) no Hoare annotation was computed. [2019-11-20 03:54:58,253 INFO L444 ceAbstractionStarter]: For program point L1414-2(lines 1414 1423) no Hoare annotation was computed. [2019-11-20 03:54:58,253 INFO L444 ceAbstractionStarter]: For program point L2339(lines 2339 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,253 INFO L444 ceAbstractionStarter]: For program point L2075(lines 2075 2085) no Hoare annotation was computed. [2019-11-20 03:54:58,253 INFO L444 ceAbstractionStarter]: For program point L2075-2(lines 2075 2085) no Hoare annotation was computed. [2019-11-20 03:54:58,253 INFO L444 ceAbstractionStarter]: For program point L490(lines 490 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,253 INFO L444 ceAbstractionStarter]: For program point L2472(lines 2472 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,253 INFO L444 ceAbstractionStarter]: For program point L2340(lines 2340 2350) no Hoare annotation was computed. [2019-11-20 03:54:58,253 INFO L444 ceAbstractionStarter]: For program point L2340-2(lines 2340 2350) no Hoare annotation was computed. [2019-11-20 03:54:58,253 INFO L444 ceAbstractionStarter]: For program point L94-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,253 INFO L444 ceAbstractionStarter]: For program point L1812(lines 1812 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,253 INFO L444 ceAbstractionStarter]: For program point L1284(lines 1284 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,253 INFO L444 ceAbstractionStarter]: For program point L1152(lines 1152 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,254 INFO L444 ceAbstractionStarter]: For program point L2209(lines 2209 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,254 INFO L444 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-11-20 03:54:58,254 INFO L444 ceAbstractionStarter]: For program point L1945(lines 1945 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,254 INFO L444 ceAbstractionStarter]: For program point L360(lines 360 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,254 INFO L444 ceAbstractionStarter]: For program point L228(lines 228 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,254 INFO L444 ceAbstractionStarter]: For program point L2210(lines 2210 2219) no Hoare annotation was computed. [2019-11-20 03:54:58,254 INFO L444 ceAbstractionStarter]: For program point L2210-2(lines 2210 2219) no Hoare annotation was computed. [2019-11-20 03:54:58,254 INFO L444 ceAbstractionStarter]: For program point L1682(lines 1682 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,254 INFO L444 ceAbstractionStarter]: For program point L625(lines 625 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,254 INFO L444 ceAbstractionStarter]: For program point L2475(lines 2475 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,254 INFO L444 ceAbstractionStarter]: For program point L97-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,254 INFO L444 ceAbstractionStarter]: For program point L1683(lines 1683 1693) no Hoare annotation was computed. [2019-11-20 03:54:58,254 INFO L444 ceAbstractionStarter]: For program point L626(lines 626 633) no Hoare annotation was computed. [2019-11-20 03:54:58,254 INFO L444 ceAbstractionStarter]: For program point L1683-2(lines 1683 1693) no Hoare annotation was computed. [2019-11-20 03:54:58,254 INFO L444 ceAbstractionStarter]: For program point L626-2(lines 626 633) no Hoare annotation was computed. [2019-11-20 03:54:58,254 INFO L444 ceAbstractionStarter]: For program point L1551(lines 1551 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,254 INFO L444 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-11-20 03:54:58,255 INFO L444 ceAbstractionStarter]: For program point L891(lines 891 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,255 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,255 INFO L444 ceAbstractionStarter]: For program point L100-1(lines 24 1644) no Hoare annotation was computed. [2019-11-20 03:54:58,255 INFO L444 ceAbstractionStarter]: For program point L1950(lines 1950 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,255 INFO L444 ceAbstractionStarter]: For program point L1818(lines 1818 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,255 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,255 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1642) no Hoare annotation was computed. [2019-11-20 03:54:58,255 INFO L444 ceAbstractionStarter]: For program point L2479(lines 2479 2570) no Hoare annotation was computed. [2019-11-20 03:54:58,255 INFO L444 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-11-20 03:54:58,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,279 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,280 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,280 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,280 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,281 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,281 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,281 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,281 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,286 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,286 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,286 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,394 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,395 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,396 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,399 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,399 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,400 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,401 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,402 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,403 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,404 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,405 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,418 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,420 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,434 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,434 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,434 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,434 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:54:58 BoogieIcfgContainer [2019-11-20 03:54:58,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:54:58,443 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:54:58,443 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:54:58,444 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:54:58,444 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:46:43" (3/4) ... [2019-11-20 03:54:58,448 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 03:54:58,519 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-20 03:54:58,524 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 03:54:58,558 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((a24 == 2 && a28 <= 134) && a26 <= 217) && a21 <= 124) && a14 + 182 <= 0) || (((((a14 + 114 <= 0 && a26 <= 215) && a21 <= 124) && 300 < a28) && !(a24 == 2)) && 0 < a14 + 182)) || ((a26 + 10118 <= 0 && (a26 + 68 <= 0 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || ((((a24 == 2 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a21 <= 124) && a26 <= 590083) && a14 + 182 <= 0)) || (((((124 < a26 && a24 == 2) && a26 <= 215) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300)) || (((a28 <= 300 && a24 == 2) && a26 + 68 <= 0 && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (((((217 < a26 && a24 == 2) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300) && a26 <= 449816)) || (((a24 == 1 && a26 <= 217) && a21 <= 124) && 0 < a14 + 84)) || ((a24 == 2 && ((124 < a26 && a26 <= 217) && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (37 < a28 && ((a26 + 68 <= 0 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((a24 == 2 && 0 <= a14 + 82) && a26 <= 124) && a21 <= 124)) || ((a28 <= 300 && (a26 + 10118 <= 0 && a24 == 2) && a21 <= 124) && 37 < a28)) || (((a26 + 68 <= 0 && !(a24 == 2)) && a21 <= 124) && 0 < a14 + 182)) || ((((124 < a26 && 300 < a28 && a24 == 2) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a14 + 182 <= 0)) || (((a26 <= 599998 && 0 <= a14 + 82) && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a21 <= 124)) || ((((217 < a26 && a24 == 1) && a21 <= 124) && a26 <= 460652) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (((a26 + 68 <= 0 && a28 + 599901 <= 0) && a21 <= 124) && a14 + 4163 <= 0)) || (((((124 < a26 && a24 == 2) && 0 < a14 + 84) && a26 <= 215) && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (a26 <= 599998 && (((a24 == 2 && a28 <= 134) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || ((((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a28 <= 300) && 37 < a28) && a14 + 182 <= 0)) || ((((a24 == 2 && a28 <= 134) && (-a26 + 596057) / -5 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || ((((0 <= a14 + 82 && a28 == 111) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a24 == 1)) || ((((0 < a14 + 114 && 300 < a28 && a24 == 2) && a21 <= 124) && 0 <= a26 + 12) && a26 <= 124)) || ((((((124 < a26 && a24 == 2) && a26 <= 217) && a21 <= 124) && a28 <= 300) && 0 < a14 + 114) && 37 < a28)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a14 + 84 <= 0)) || (((((a28 <= 134 && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && !(a24 == 2)) && 0 < a14 + 182)) || (((\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28) && (\exists v_~a26~0_1226 : int :: (a26 <= v_~a26~0_1226 / 5 + 460627 && v_~a26~0_1226 <= 124) && 0 <= v_~a26~0_1226) && 300 < a28 && a24 == 2) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && 0 < a26 + 68) && a14 + 84 <= 0) && a26 <= 124)) || (((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a14 + 85 <= 0) && a21 <= 124) && 0 < a14 + 182)) || (((((a28 <= 134 && !(a24 == 2)) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || (((((a26 <= 321684 && 217 < a26) && a24 == 2) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || ((a26 + 68 <= 0 && (300 < a28 && a24 == 2) && a21 <= 124) && a14 + 182 <= 0)) || (((a26 + 68 <= 0 && a21 <= 124) && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 + 150557 <= a28) || (((300 < a28 && a26 + 139421 <= 0) && a14 + 182 <= 0) && a21 <= 124)) || (((((((a28 <= 300 && a14 + 114 <= 0) && a21 <= 124) && a24 == 2) && 0 < a14 + 182) && 37 < a28) && 0 <= a26 + 12) && a26 <= 217)) || ((a26 <= 217 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && ((a24 == 2 && a28 <= 279) && a14 + 182 <= 0) && a21 <= 124)) || (a24 == 1 && (a14 + 114 <= 0 || a26 <= 124))) || (((300 < a28 && (\exists v_~a26~0_1243 : int :: (v_~a26~0_1243 * -1 + 596057) / -5 <= 124 && a26 + 600073 <= v_~a26~0_1243)) && a14 + 4163 <= 0) && a21 <= 124)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a26 <= 217)) || ((((a28 <= 134 && a24 == 2) && 37 < a28) && (-a26 + 596057) / -5 <= 124) && a21 <= 124)) || ((a28 <= 134 && a24 == 1) && a26 <= 217)) || ((((0 < a26 + 68 && a21 <= 124) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 124)) || (((((a28 <= 279 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && 0 < a26 + 68) && a14 + 4163 <= 0) && a21 <= 124) && a26 <= 124)) || (((a26 <= 599998 && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124) [2019-11-20 03:54:58,563 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((a24 == 2 && a28 <= 134) && a26 <= 217) && a21 <= 124) && a14 + 182 <= 0) || (((((a14 + 114 <= 0 && a26 <= 215) && a21 <= 124) && 300 < a28) && !(a24 == 2)) && 0 < a14 + 182)) || ((a26 + 10118 <= 0 && (a26 + 68 <= 0 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || ((((a24 == 2 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a21 <= 124) && a26 <= 590083) && a14 + 182 <= 0)) || (((((124 < a26 && a24 == 2) && a26 <= 215) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300)) || (((a28 <= 300 && a24 == 2) && a26 + 68 <= 0 && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (((((217 < a26 && a24 == 2) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300) && a26 <= 449816)) || (((a24 == 1 && a26 <= 217) && a21 <= 124) && 0 < a14 + 84)) || ((a24 == 2 && ((124 < a26 && a26 <= 217) && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (37 < a28 && ((a26 + 68 <= 0 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((a24 == 2 && 0 <= a14 + 82) && a26 <= 124) && a21 <= 124)) || ((a28 <= 300 && (a26 + 10118 <= 0 && a24 == 2) && a21 <= 124) && 37 < a28)) || (((a26 + 68 <= 0 && !(a24 == 2)) && a21 <= 124) && 0 < a14 + 182)) || ((((124 < a26 && 300 < a28 && a24 == 2) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a14 + 182 <= 0)) || (((a26 <= 599998 && 0 <= a14 + 82) && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a21 <= 124)) || ((((217 < a26 && a24 == 1) && a21 <= 124) && a26 <= 460652) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (((a26 + 68 <= 0 && a28 + 599901 <= 0) && a21 <= 124) && a14 + 4163 <= 0)) || (((((124 < a26 && a24 == 2) && 0 < a14 + 84) && a26 <= 215) && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (a26 <= 599998 && (((a24 == 2 && a28 <= 134) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || ((((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a28 <= 300) && 37 < a28) && a14 + 182 <= 0)) || ((((a24 == 2 && a28 <= 134) && (-a26 + 596057) / -5 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || ((((0 <= a14 + 82 && a28 == 111) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a24 == 1)) || ((((0 < a14 + 114 && 300 < a28 && a24 == 2) && a21 <= 124) && 0 <= a26 + 12) && a26 <= 124)) || ((((((124 < a26 && a24 == 2) && a26 <= 217) && a21 <= 124) && a28 <= 300) && 0 < a14 + 114) && 37 < a28)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a14 + 84 <= 0)) || (((((a28 <= 134 && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && !(a24 == 2)) && 0 < a14 + 182)) || (((\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28) && (\exists v_~a26~0_1226 : int :: (a26 <= v_~a26~0_1226 / 5 + 460627 && v_~a26~0_1226 <= 124) && 0 <= v_~a26~0_1226) && 300 < a28 && a24 == 2) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && 0 < a26 + 68) && a14 + 84 <= 0) && a26 <= 124)) || (((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a14 + 85 <= 0) && a21 <= 124) && 0 < a14 + 182)) || (((((a28 <= 134 && !(a24 == 2)) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || (((((a26 <= 321684 && 217 < a26) && a24 == 2) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || ((a26 + 68 <= 0 && (300 < a28 && a24 == 2) && a21 <= 124) && a14 + 182 <= 0)) || (((a26 + 68 <= 0 && a21 <= 124) && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 + 150557 <= a28) || (((300 < a28 && a26 + 139421 <= 0) && a14 + 182 <= 0) && a21 <= 124)) || (((((((a28 <= 300 && a14 + 114 <= 0) && a21 <= 124) && a24 == 2) && 0 < a14 + 182) && 37 < a28) && 0 <= a26 + 12) && a26 <= 217)) || ((a26 <= 217 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && ((a24 == 2 && a28 <= 279) && a14 + 182 <= 0) && a21 <= 124)) || (a24 == 1 && (a14 + 114 <= 0 || a26 <= 124))) || (((300 < a28 && (\exists v_~a26~0_1243 : int :: (v_~a26~0_1243 * -1 + 596057) / -5 <= 124 && a26 + 600073 <= v_~a26~0_1243)) && a14 + 4163 <= 0) && a21 <= 124)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a26 <= 217)) || ((((a28 <= 134 && a24 == 2) && 37 < a28) && (-a26 + 596057) / -5 <= 124) && a21 <= 124)) || ((a28 <= 134 && a24 == 1) && a26 <= 217)) || ((((0 < a26 + 68 && a21 <= 124) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 124)) || (((((a28 <= 279 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && 0 < a26 + 68) && a14 + 4163 <= 0) && a21 <= 124) && a26 <= 124)) || (((a26 <= 599998 && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124) [2019-11-20 03:54:58,577 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((((a24 == 2 && a28 <= 134) && a26 <= 217) && a21 <= 124) && a14 + 182 <= 0) || ((((a26 + 68 <= 0 && 0 < a14 + 114) && 300 < a28 && a24 == 2) && a14 + 85 <= 0) && a21 <= 124)) || (((((a14 + 114 <= 0 && a26 <= 215) && a21 <= 124) && 300 < a28) && !(a24 == 2)) && 0 < a14 + 182)) || ((a26 + 10118 <= 0 && (a26 + 68 <= 0 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || ((((a24 == 2 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a21 <= 124) && a26 <= 590083) && a14 + 182 <= 0)) || (((((124 < a26 && a24 == 2) && a26 <= 215) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300)) || (((((a26 <= 449816 && (((((a28 <= 300 || a14 + 114 <= 0) || 0 < a14 + 84) && (37 < a28 || a14 + 84 <= 0)) || !(5 == input)) || 0 < a26 + 68)) && 0 < a14 + 114) && 300 < a28 && a24 == 2) && a21 <= 124) && a14 + 84 <= 0)) || (((a28 <= 300 && a24 == 2) && a26 + 68 <= 0 && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (((((217 < a26 && a24 == 2) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300) && a26 <= 449816)) || (((a24 == 1 && a26 <= 217) && a21 <= 124) && 0 < a14 + 84)) || ((a24 == 2 && ((124 < a26 && a26 <= 217) && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || ((a28 <= 300 && 37 < a28) && ((a26 + 68 <= 0 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (0 < a26 + 68 && ((a24 == 2 && 0 <= a14 + 82) && a26 <= 124) && a21 <= 124)) || (((((a24 == 2 && a26 <= 449816) && a28 <= 279) && a14 + 182 <= 0) && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || ((a28 <= 300 && (a26 + 10118 <= 0 && a24 == 2) && a21 <= 124) && 37 < a28)) || (((a26 + 68 <= 0 && !(a24 == 2)) && a21 <= 124) && 0 < a14 + 182)) || ((((124 < a26 && 300 < a28 && a24 == 2) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a14 + 182 <= 0)) || (((a26 <= 599998 && 0 <= a14 + 82) && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a21 <= 124)) || ((((217 < a26 && a24 == 1) && a21 <= 124) && a26 <= 460652) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (((a26 + 68 <= 0 && a28 + 599901 <= 0) && a21 <= 124) && a14 + 4163 <= 0)) || (((((124 < a26 && a24 == 2) && 0 < a14 + 84) && a26 <= 215) && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (a26 <= 599998 && (((a24 == 2 && a28 <= 134) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || ((((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a28 <= 300) && 37 < a28) && a14 + 182 <= 0)) || ((((a24 == 2 && a28 <= 134) && (-a26 + 596057) / -5 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || ((((0 <= a14 + 82 && a28 == 111) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a24 == 1)) || ((((0 < a14 + 84 && 300 < a28 && a24 == 2) && a21 <= 124) && 0 <= a26 + 12) && a26 <= 124)) || ((((((124 < a26 && a24 == 2) && a26 <= 217) && a21 <= 124) && a28 <= 300) && 0 < a14 + 114) && 37 < a28)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a14 + 84 <= 0)) || (((((a28 <= 134 && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && !(a24 == 2)) && 0 < a14 + 182)) || (((((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && 0 < a26 + 68) && a14 + 84 <= 0) && a26 <= 124)) || (((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a14 + 85 <= 0) && a21 <= 124) && 0 < a14 + 182)) || (((((a28 <= 134 && !(a24 == 2)) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || ((((\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28) && a21 <= 124) && (a14 + 114 <= 0 || 0 < a14 + 84)) && (\exists v_~a26~0_1226 : int :: (a26 <= v_~a26~0_1226 / 5 + 460627 && v_~a26~0_1226 <= 124) && 0 <= v_~a26~0_1226) && 300 < a28 && a24 == 2)) || (((((a26 <= 321684 && 217 < a26) && a24 == 2) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || ((a26 + 68 <= 0 && (300 < a28 && a24 == 2) && a21 <= 124) && a14 + 182 <= 0)) || (((a26 + 68 <= 0 && 0 <= a14 + 82) && a21 <= 124) && (((((a28 <= 300 || a14 + 114 <= 0) || 0 < a14 + 84) && (37 < a28 || a14 + 84 <= 0)) || !(5 == input)) || 0 < a26 + 68))) || ((((a26 + 68 <= 0 && a14 + 114 <= 0) && a21 <= 124) && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 + 150557 <= a28) || (((300 < a28 && a26 + 139421 <= 0) && a14 + 182 <= 0) && a21 <= 124)) || (((((((a28 <= 300 && a14 + 114 <= 0) && a21 <= 124) && a24 == 2) && 0 < a14 + 182) && 37 < a28) && 0 <= a26 + 12) && a26 <= 217)) || (a24 == 1 && (a14 + 114 <= 0 || a26 <= 124))) || (((300 < a28 && (\exists v_~a26~0_1243 : int :: (v_~a26~0_1243 * -1 + 596057) / -5 <= 124 && a26 + 600073 <= v_~a26~0_1243)) && a14 + 4163 <= 0) && a21 <= 124)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a26 <= 217)) || ((((a28 <= 134 && a24 == 2) && 37 < a28) && (-a26 + 596057) / -5 <= 124) && a21 <= 124)) || ((a28 <= 134 && a24 == 1) && a26 <= 217)) || ((((0 < a26 + 68 && a21 <= 124) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 124)) || (((((a28 <= 279 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && 0 < a26 + 68) && a14 + 4163 <= 0) && a21 <= 124) && a26 <= 124)) || (((a26 <= 599998 && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124) [2019-11-20 03:54:58,828 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c21a4676-8bcf-4f03-9207-4dbcf53cb536/bin/uautomizer/witness.graphml [2019-11-20 03:54:58,828 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:54:58,829 INFO L168 Benchmark]: Toolchain (without parser) took 502497.73 ms. Allocated memory was 1.0 GB in the beginning and 5.8 GB in the end (delta: 4.8 GB). Free memory was 932.7 MB in the beginning and 4.7 GB in the end (delta: -3.8 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-11-20 03:54:58,830 INFO L168 Benchmark]: CDTParser took 0.23 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-20 03:54:58,830 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1544.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 932.7 MB in the beginning and 999.0 MB in the end (delta: -66.3 MB). Peak memory consumption was 74.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:54:58,830 INFO L168 Benchmark]: Boogie Procedure Inliner took 262.85 ms. Allocated memory is still 1.2 GB. Free memory was 999.0 MB in the beginning and 934.4 MB in the end (delta: 64.6 MB). Peak memory consumption was 64.6 MB. Max. memory is 11.5 GB. [2019-11-20 03:54:58,831 INFO L168 Benchmark]: Boogie Preprocessor took 281.67 ms. Allocated memory is still 1.2 GB. Free memory was 934.4 MB in the beginning and 902.2 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-11-20 03:54:58,831 INFO L168 Benchmark]: RCFGBuilder took 4653.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 103.8 MB). Free memory was 902.2 MB in the beginning and 1.0 GB in the end (delta: -108.2 MB). Peak memory consumption was 109.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:54:58,831 INFO L168 Benchmark]: TraceAbstraction took 495366.04 ms. Allocated memory was 1.3 GB in the beginning and 5.8 GB in the end (delta: 4.6 GB). Free memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: -3.8 GB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. [2019-11-20 03:54:58,832 INFO L168 Benchmark]: Witness Printer took 385.29 ms. Allocated memory is still 5.8 GB. Free memory was 4.8 GB in the beginning and 4.7 GB in the end (delta: 104.4 MB). Peak memory consumption was 104.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:54:58,834 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1544.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 932.7 MB in the beginning and 999.0 MB in the end (delta: -66.3 MB). Peak memory consumption was 74.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 262.85 ms. Allocated memory is still 1.2 GB. Free memory was 999.0 MB in the beginning and 934.4 MB in the end (delta: 64.6 MB). Peak memory consumption was 64.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 281.67 ms. Allocated memory is still 1.2 GB. Free memory was 934.4 MB in the beginning and 902.2 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4653.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 103.8 MB). Free memory was 902.2 MB in the beginning and 1.0 GB in the end (delta: -108.2 MB). Peak memory consumption was 109.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 495366.04 ms. Allocated memory was 1.3 GB in the beginning and 5.8 GB in the end (delta: 4.6 GB). Free memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: -3.8 GB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. * Witness Printer took 385.29 ms. Allocated memory is still 5.8 GB. Free memory was 4.8 GB in the beginning and 4.7 GB in the end (delta: 104.4 MB). Peak memory consumption was 104.4 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_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 110]: 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-20 03:54:58,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,881 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,882 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,883 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,884 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,885 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,885 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,885 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,886 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,886 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,886 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,887 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,887 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,887 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,888 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,888 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,888 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,889 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,891 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((a24 == 2 && a28 <= 134) && a26 <= 217) && a21 <= 124) && a14 + 182 <= 0) || (((((a14 + 114 <= 0 && a26 <= 215) && a21 <= 124) && 300 < a28) && !(a24 == 2)) && 0 < a14 + 182)) || ((a26 + 10118 <= 0 && (a26 + 68 <= 0 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || ((((a24 == 2 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a21 <= 124) && a26 <= 590083) && a14 + 182 <= 0)) || (((((124 < a26 && a24 == 2) && a26 <= 215) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300)) || (((a28 <= 300 && a24 == 2) && a26 + 68 <= 0 && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (((((217 < a26 && a24 == 2) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300) && a26 <= 449816)) || (((a24 == 1 && a26 <= 217) && a21 <= 124) && 0 < a14 + 84)) || ((a24 == 2 && ((124 < a26 && a26 <= 217) && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (37 < a28 && ((a26 + 68 <= 0 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((a24 == 2 && 0 <= a14 + 82) && a26 <= 124) && a21 <= 124)) || ((a28 <= 300 && (a26 + 10118 <= 0 && a24 == 2) && a21 <= 124) && 37 < a28)) || (((a26 + 68 <= 0 && !(a24 == 2)) && a21 <= 124) && 0 < a14 + 182)) || ((((124 < a26 && 300 < a28 && a24 == 2) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a14 + 182 <= 0)) || (((a26 <= 599998 && 0 <= a14 + 82) && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a21 <= 124)) || ((((217 < a26 && a24 == 1) && a21 <= 124) && a26 <= 460652) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (((a26 + 68 <= 0 && a28 + 599901 <= 0) && a21 <= 124) && a14 + 4163 <= 0)) || (((((124 < a26 && a24 == 2) && 0 < a14 + 84) && a26 <= 215) && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (a26 <= 599998 && (((a24 == 2 && a28 <= 134) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || ((((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a28 <= 300) && 37 < a28) && a14 + 182 <= 0)) || ((((a24 == 2 && a28 <= 134) && (-a26 + 596057) / -5 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || ((((0 <= a14 + 82 && a28 == 111) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a24 == 1)) || ((((0 < a14 + 114 && 300 < a28 && a24 == 2) && a21 <= 124) && 0 <= a26 + 12) && a26 <= 124)) || ((((((124 < a26 && a24 == 2) && a26 <= 217) && a21 <= 124) && a28 <= 300) && 0 < a14 + 114) && 37 < a28)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a14 + 84 <= 0)) || (((((a28 <= 134 && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && !(a24 == 2)) && 0 < a14 + 182)) || (((\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28) && (\exists v_~a26~0_1226 : int :: (a26 <= v_~a26~0_1226 / 5 + 460627 && v_~a26~0_1226 <= 124) && 0 <= v_~a26~0_1226) && 300 < a28 && a24 == 2) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && 0 < a26 + 68) && a14 + 84 <= 0) && a26 <= 124)) || (((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a14 + 85 <= 0) && a21 <= 124) && 0 < a14 + 182)) || (((((a28 <= 134 && !(a24 == 2)) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || (((((a26 <= 321684 && 217 < a26) && a24 == 2) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || ((a26 + 68 <= 0 && (300 < a28 && a24 == 2) && a21 <= 124) && a14 + 182 <= 0)) || (((a26 + 68 <= 0 && a21 <= 124) && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 + 150557 <= a28) || (((300 < a28 && a26 + 139421 <= 0) && a14 + 182 <= 0) && a21 <= 124)) || (((((((a28 <= 300 && a14 + 114 <= 0) && a21 <= 124) && a24 == 2) && 0 < a14 + 182) && 37 < a28) && 0 <= a26 + 12) && a26 <= 217)) || ((a26 <= 217 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && ((a24 == 2 && a28 <= 279) && a14 + 182 <= 0) && a21 <= 124)) || (a24 == 1 && (a14 + 114 <= 0 || a26 <= 124))) || (((300 < a28 && (\exists v_~a26~0_1243 : int :: (v_~a26~0_1243 * -1 + 596057) / -5 <= 124 && a26 + 600073 <= v_~a26~0_1243)) && a14 + 4163 <= 0) && a21 <= 124)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a26 <= 217)) || ((((a28 <= 134 && a24 == 2) && 37 < a28) && (-a26 + 596057) / -5 <= 124) && a21 <= 124)) || ((a28 <= 134 && a24 == 1) && a26 <= 217)) || ((((0 < a26 + 68 && a21 <= 124) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 124)) || (((((a28 <= 279 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && 0 < a26 + 68) && a14 + 4163 <= 0) && a21 <= 124) && a26 <= 124)) || (((a26 <= 599998 && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124) - InvariantResult [Line: 1646]: Loop Invariant [2019-11-20 03:54:58,895 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,907 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,914 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((a24 == 2 && a28 <= 134) && a26 <= 217) && a21 <= 124) && a14 + 182 <= 0) || ((((a26 + 68 <= 0 && 0 < a14 + 114) && 300 < a28 && a24 == 2) && a14 + 85 <= 0) && a21 <= 124)) || (((((a14 + 114 <= 0 && a26 <= 215) && a21 <= 124) && 300 < a28) && !(a24 == 2)) && 0 < a14 + 182)) || ((a26 + 10118 <= 0 && (a26 + 68 <= 0 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || ((((a24 == 2 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a21 <= 124) && a26 <= 590083) && a14 + 182 <= 0)) || (((((124 < a26 && a24 == 2) && a26 <= 215) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300)) || (((((a26 <= 449816 && (((((a28 <= 300 || a14 + 114 <= 0) || 0 < a14 + 84) && (37 < a28 || a14 + 84 <= 0)) || !(5 == input)) || 0 < a26 + 68)) && 0 < a14 + 114) && 300 < a28 && a24 == 2) && a21 <= 124) && a14 + 84 <= 0)) || (((a28 <= 300 && a24 == 2) && a26 + 68 <= 0 && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (((((217 < a26 && a24 == 2) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300) && a26 <= 449816)) || (((a24 == 1 && a26 <= 217) && a21 <= 124) && 0 < a14 + 84)) || ((a24 == 2 && ((124 < a26 && a26 <= 217) && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || ((a28 <= 300 && 37 < a28) && ((a26 + 68 <= 0 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (0 < a26 + 68 && ((a24 == 2 && 0 <= a14 + 82) && a26 <= 124) && a21 <= 124)) || (((((a24 == 2 && a26 <= 449816) && a28 <= 279) && a14 + 182 <= 0) && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || ((a28 <= 300 && (a26 + 10118 <= 0 && a24 == 2) && a21 <= 124) && 37 < a28)) || (((a26 + 68 <= 0 && !(a24 == 2)) && a21 <= 124) && 0 < a14 + 182)) || ((((124 < a26 && 300 < a28 && a24 == 2) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a14 + 182 <= 0)) || (((a26 <= 599998 && 0 <= a14 + 82) && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a21 <= 124)) || ((((217 < a26 && a24 == 1) && a21 <= 124) && a26 <= 460652) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (((a26 + 68 <= 0 && a28 + 599901 <= 0) && a21 <= 124) && a14 + 4163 <= 0)) || (((((124 < a26 && a24 == 2) && 0 < a14 + 84) && a26 <= 215) && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (a26 <= 599998 && (((a24 == 2 && a28 <= 134) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || ((((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a28 <= 300) && 37 < a28) && a14 + 182 <= 0)) || ((((a24 == 2 && a28 <= 134) && (-a26 + 596057) / -5 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || ((((0 <= a14 + 82 && a28 == 111) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a24 == 1)) || ((((0 < a14 + 84 && 300 < a28 && a24 == 2) && a21 <= 124) && 0 <= a26 + 12) && a26 <= 124)) || ((((((124 < a26 && a24 == 2) && a26 <= 217) && a21 <= 124) && a28 <= 300) && 0 < a14 + 114) && 37 < a28)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a14 + 84 <= 0)) || (((((a28 <= 134 && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && !(a24 == 2)) && 0 < a14 + 182)) || (((((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && 0 < a26 + 68) && a14 + 84 <= 0) && a26 <= 124)) || (((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a14 + 85 <= 0) && a21 <= 124) && 0 < a14 + 182)) || (((((a28 <= 134 && !(a24 == 2)) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || ((((\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28) && a21 <= 124) && (a14 + 114 <= 0 || 0 < a14 + 84)) && (\exists v_~a26~0_1226 : int :: (a26 <= v_~a26~0_1226 / 5 + 460627 && v_~a26~0_1226 <= 124) && 0 <= v_~a26~0_1226) && 300 < a28 && a24 == 2)) || (((((a26 <= 321684 && 217 < a26) && a24 == 2) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || ((a26 + 68 <= 0 && (300 < a28 && a24 == 2) && a21 <= 124) && a14 + 182 <= 0)) || (((a26 + 68 <= 0 && 0 <= a14 + 82) && a21 <= 124) && (((((a28 <= 300 || a14 + 114 <= 0) || 0 < a14 + 84) && (37 < a28 || a14 + 84 <= 0)) || !(5 == input)) || 0 < a26 + 68))) || ((((a26 + 68 <= 0 && a14 + 114 <= 0) && a21 <= 124) && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 + 150557 <= a28) || (((300 < a28 && a26 + 139421 <= 0) && a14 + 182 <= 0) && a21 <= 124)) || (((((((a28 <= 300 && a14 + 114 <= 0) && a21 <= 124) && a24 == 2) && 0 < a14 + 182) && 37 < a28) && 0 <= a26 + 12) && a26 <= 217)) || (a24 == 1 && (a14 + 114 <= 0 || a26 <= 124))) || (((300 < a28 && (\exists v_~a26~0_1243 : int :: (v_~a26~0_1243 * -1 + 596057) / -5 <= 124 && a26 + 600073 <= v_~a26~0_1243)) && a14 + 4163 <= 0) && a21 <= 124)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a26 <= 217)) || ((((a28 <= 134 && a24 == 2) && 37 < a28) && (-a26 + 596057) / -5 <= 124) && a21 <= 124)) || ((a28 <= 134 && a24 == 1) && a26 <= 217)) || ((((0 < a26 + 68 && a21 <= 124) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 124)) || (((((a28 <= 279 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && 0 < a26 + 68) && a14 + 4163 <= 0) && a21 <= 124) && a26 <= 124)) || (((a26 <= 599998 && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124) - InvariantResult [Line: 24]: Loop Invariant [2019-11-20 03:54:58,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-11-20 03:54:58,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-11-20 03:54:58,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-11-20 03:54:58,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-11-20 03:54:58,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-11-20 03:54:58,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((a24 == 2 && a28 <= 134) && a26 <= 217) && a21 <= 124) && a14 + 182 <= 0) || (((((a14 + 114 <= 0 && a26 <= 215) && a21 <= 124) && 300 < a28) && !(a24 == 2)) && 0 < a14 + 182)) || ((a26 + 10118 <= 0 && (a26 + 68 <= 0 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || ((((a24 == 2 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a21 <= 124) && a26 <= 590083) && a14 + 182 <= 0)) || (((((124 < a26 && a24 == 2) && a26 <= 215) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300)) || (((a28 <= 300 && a24 == 2) && a26 + 68 <= 0 && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (((((217 < a26 && a24 == 2) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) && a28 <= 300) && a26 <= 449816)) || (((a24 == 1 && a26 <= 217) && a21 <= 124) && 0 < a14 + 84)) || ((a24 == 2 && ((124 < a26 && a26 <= 217) && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (37 < a28 && ((a26 + 68 <= 0 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((a24 == 2 && 0 <= a14 + 82) && a26 <= 124) && a21 <= 124)) || ((a28 <= 300 && (a26 + 10118 <= 0 && a24 == 2) && a21 <= 124) && 37 < a28)) || (((a26 + 68 <= 0 && !(a24 == 2)) && a21 <= 124) && 0 < a14 + 182)) || ((((124 < a26 && 300 < a28 && a24 == 2) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a14 + 182 <= 0)) || (((a26 <= 599998 && 0 <= a14 + 82) && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a21 <= 124)) || ((((217 < a26 && a24 == 1) && a21 <= 124) && a26 <= 460652) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (((a26 + 68 <= 0 && a28 + 599901 <= 0) && a21 <= 124) && a14 + 4163 <= 0)) || (((((124 < a26 && a24 == 2) && 0 < a14 + 84) && a26 <= 215) && a21 <= 124) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948))) || (a26 <= 599998 && (((a24 == 2 && a28 <= 134) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || ((((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a28 <= 300) && 37 < a28) && a14 + 182 <= 0)) || ((((a24 == 2 && a28 <= 134) && (-a26 + 596057) / -5 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || ((((0 <= a14 + 82 && a28 == 111) && a21 <= 124) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a24 == 1)) || ((((0 < a14 + 114 && 300 < a28 && a24 == 2) && a21 <= 124) && 0 <= a26 + 12) && a26 <= 124)) || ((((((124 < a26 && a24 == 2) && a26 <= 217) && a21 <= 124) && a28 <= 300) && 0 < a14 + 114) && 37 < a28)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a14 + 84 <= 0)) || (((((a28 <= 134 && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && !(a24 == 2)) && 0 < a14 + 182)) || (((\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28) && (\exists v_~a26~0_1226 : int :: (a26 <= v_~a26~0_1226 / 5 + 460627 && v_~a26~0_1226 <= 124) && 0 <= v_~a26~0_1226) && 300 < a28 && a24 == 2) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && 0 < a26 + 68) && a14 + 84 <= 0) && a26 <= 124)) || (((((217 < a26 && a24 == 2) && (-a26 + 596057) / -5 <= 124) && a14 + 85 <= 0) && a21 <= 124) && 0 < a14 + 182)) || (((((a28 <= 134 && !(a24 == 2)) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || (((((a26 <= 321684 && 217 < a26) && a24 == 2) && a21 <= 124) && 37 < a28) && a14 + 182 <= 0)) || ((a26 + 68 <= 0 && (300 < a28 && a24 == 2) && a21 <= 124) && a14 + 182 <= 0)) || (((a26 + 68 <= 0 && a21 <= 124) && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 + 150557 <= a28) || (((300 < a28 && a26 + 139421 <= 0) && a14 + 182 <= 0) && a21 <= 124)) || (((((((a28 <= 300 && a14 + 114 <= 0) && a21 <= 124) && a24 == 2) && 0 < a14 + 182) && 37 < a28) && 0 <= a26 + 12) && a26 <= 217)) || ((a26 <= 217 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && ((a24 == 2 && a28 <= 279) && a14 + 182 <= 0) && a21 <= 124)) || (a24 == 1 && (a14 + 114 <= 0 || a26 <= 124))) || (((300 < a28 && (\exists v_~a26~0_1243 : int :: (v_~a26~0_1243 * -1 + 596057) / -5 <= 124 && a26 + 600073 <= v_~a26~0_1243)) && a14 + 4163 <= 0) && a21 <= 124)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a26 <= 217)) || ((((a28 <= 134 && a24 == 2) && 37 < a28) && (-a26 + 596057) / -5 <= 124) && a21 <= 124)) || ((a28 <= 134 && a24 == 1) && a26 <= 217)) || ((((0 < a26 + 68 && a21 <= 124) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 124)) || (((((a28 <= 279 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && 0 < a26 + 68) && a14 + 4163 <= 0) && a21 <= 124) && a26 <= 124)) || (((a26 <= 599998 && (217 < a26 && a24 == 2) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 590 locations, 1 error locations. Result: SAFE, OverallTime: 495.1s, OverallIterations: 36, TraceHistogramMax: 13, AutomataDifference: 251.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 112.1s, HoareTripleCheckerStatistics: 11588 SDtfs, 58554 SDslu, 3513 SDs, 0 SdLazy, 146860 SolverSat, 17005 SolverUnsat, 25 SolverUnknown, 0 SolverNotchecked, 209.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14582 GetRequests, 14294 SyntacticMatches, 11 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3963 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104301occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.9s AutomataMinimizationTime, 36 MinimizatonAttempts, 329909 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 717 NumberOfFragments, 3670 HoareAnnotationTreeSize, 4 FomulaSimplifications, 332246712 FormulaSimplificationTreeSizeReduction, 24.9s HoareSimplificationTime, 4 FomulaSimplificationsInter, 317933403 FormulaSimplificationTreeSizeReductionInter, 87.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.4s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 41.5s InterpolantComputationTime, 49563 NumberOfCodeBlocks, 49563 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 49513 ConstructedInterpolants, 1679 QuantifiedInterpolants, 313182889 SizeOfPredicates, 17 NumberOfNonLiveVariables, 16888 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 50 InterpolantComputations, 33 PerfectInterpolantSequences, 104785/114906 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...