./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label44.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/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 0353c543ba4bfdaef5ec6741581eb9d536c42e96 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:33:51,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:33:51,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:33:51,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:33:51,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:33:51,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:33:51,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:33:51,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:33:51,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:33:51,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:33:51,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:33:51,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:33:51,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:33:51,710 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:33:51,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:33:51,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:33:51,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:33:51,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:33:51,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:33:51,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:33:51,716 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:33:51,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:33:51,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:33:51,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:33:51,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:33:51,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:33:51,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:33:51,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:33:51,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:33:51,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:33:51,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:33:51,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:33:51,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:33:51,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:33:51,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:33:51,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:33:51,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:33:51,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:33:51,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:33:51,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:33:51,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:33:51,725 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:33:51,734 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:33:51,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:33:51,734 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:33:51,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:33:51,735 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:33:51,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:33:51,735 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:33:51,735 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:33:51,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:33:51,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:33:51,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:33:51,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:33:51,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:33:51,736 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:33:51,736 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:33:51,736 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:33:51,736 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:33:51,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:33:51,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:33:51,736 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:33:51,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:33:51,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:33:51,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:33:51,737 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:33:51,737 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:33:51,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:33:51,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:33:51,737 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:33:51,737 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:33:51,737 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_a87728ad-0fab-42c2-a718-58b8c02ccb40/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 -> 0353c543ba4bfdaef5ec6741581eb9d536c42e96 [2019-12-07 18:33:51,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:33:51,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:33:51,846 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:33:51,847 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:33:51,848 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:33:51,848 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label44.c [2019-12-07 18:33:51,886 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/bin/uautomizer/data/72ce6dc5b/c7c239e7dc8543e994f0d94d028d400c/FLAG024a6702c [2019-12-07 18:33:52,314 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:33:52,315 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/sv-benchmarks/c/eca-rers2012/Problem15_label44.c [2019-12-07 18:33:52,331 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/bin/uautomizer/data/72ce6dc5b/c7c239e7dc8543e994f0d94d028d400c/FLAG024a6702c [2019-12-07 18:33:52,344 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/bin/uautomizer/data/72ce6dc5b/c7c239e7dc8543e994f0d94d028d400c [2019-12-07 18:33:52,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:33:52,348 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:33:52,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:33:52,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:33:52,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:33:52,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:33:52" (1/1) ... [2019-12-07 18:33:52,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b15af8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:52, skipping insertion in model container [2019-12-07 18:33:52,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:33:52" (1/1) ... [2019-12-07 18:33:52,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:33:52,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:33:52,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:33:52,868 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:33:53,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:33:53,052 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:33:53,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:53 WrapperNode [2019-12-07 18:33:53,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:33:53,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:33:53,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:33:53,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:33:53,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:53" (1/1) ... [2019-12-07 18:33:53,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:53" (1/1) ... [2019-12-07 18:33:53,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:33:53,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:33:53,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:33:53,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:33:53,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:53" (1/1) ... [2019-12-07 18:33:53,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:53" (1/1) ... [2019-12-07 18:33:53,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:53" (1/1) ... [2019-12-07 18:33:53,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:53" (1/1) ... [2019-12-07 18:33:53,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:53" (1/1) ... [2019-12-07 18:33:53,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:53" (1/1) ... [2019-12-07 18:33:53,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:53" (1/1) ... [2019-12-07 18:33:53,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:33:53,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:33:53,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:33:53,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:33:53,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:33:53,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:33:53,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:33:55,164 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:33:55,164 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 18:33:55,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:33:55 BoogieIcfgContainer [2019-12-07 18:33:55,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:33:55,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:33:55,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:33:55,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:33:55,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:33:52" (1/3) ... [2019-12-07 18:33:55,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1f0d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:33:55, skipping insertion in model container [2019-12-07 18:33:55,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:33:53" (2/3) ... [2019-12-07 18:33:55,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1f0d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:33:55, skipping insertion in model container [2019-12-07 18:33:55,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:33:55" (3/3) ... [2019-12-07 18:33:55,170 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label44.c [2019-12-07 18:33:55,177 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:33:55,182 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:33:55,190 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:33:55,209 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:33:55,209 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:33:55,209 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:33:55,209 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:33:55,209 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:33:55,210 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:33:55,210 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:33:55,210 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:33:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-12-07 18:33:55,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:33:55,232 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:33:55,233 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:33:55,233 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:33:55,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:33:55,236 INFO L82 PathProgramCache]: Analyzing trace with hash -215114758, now seen corresponding path program 1 times [2019-12-07 18:33:55,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:33:55,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243799872] [2019-12-07 18:33:55,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:33:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:55,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:33:55,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243799872] [2019-12-07 18:33:55,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:33:55,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:33:55,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347789999] [2019-12-07 18:33:55,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:33:55,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:33:55,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:33:55,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:33:55,439 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-12-07 18:33:58,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:33:58,629 INFO L93 Difference]: Finished difference Result 1457 states and 2706 transitions. [2019-12-07 18:33:58,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:33:58,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 18:33:58,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:33:58,648 INFO L225 Difference]: With dead ends: 1457 [2019-12-07 18:33:58,648 INFO L226 Difference]: Without dead ends: 965 [2019-12-07 18:33:58,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:33:58,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-12-07 18:33:58,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 662. [2019-12-07 18:33:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-12-07 18:33:58,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 979 transitions. [2019-12-07 18:33:58,708 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 979 transitions. Word has length 66 [2019-12-07 18:33:58,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:33:58,708 INFO L462 AbstractCegarLoop]: Abstraction has 662 states and 979 transitions. [2019-12-07 18:33:58,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:33:58,708 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 979 transitions. [2019-12-07 18:33:58,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-07 18:33:58,712 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:33:58,712 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:33:58,712 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:33:58,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:33:58,713 INFO L82 PathProgramCache]: Analyzing trace with hash 333594229, now seen corresponding path program 1 times [2019-12-07 18:33:58,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:33:58,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59087842] [2019-12-07 18:33:58,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:33:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:33:58,910 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:33:58,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59087842] [2019-12-07 18:33:58,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:33:58,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:33:58,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359832126] [2019-12-07 18:33:58,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:33:58,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:33:58,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:33:58,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:33:58,913 INFO L87 Difference]: Start difference. First operand 662 states and 979 transitions. Second operand 5 states. [2019-12-07 18:34:01,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:01,749 INFO L93 Difference]: Finished difference Result 2244 states and 3236 transitions. [2019-12-07 18:34:01,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:34:01,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-12-07 18:34:01,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:01,756 INFO L225 Difference]: With dead ends: 2244 [2019-12-07 18:34:01,756 INFO L226 Difference]: Without dead ends: 1584 [2019-12-07 18:34:01,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:34:01,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2019-12-07 18:34:01,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1277. [2019-12-07 18:34:01,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1277 states. [2019-12-07 18:34:01,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1746 transitions. [2019-12-07 18:34:01,781 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1746 transitions. Word has length 131 [2019-12-07 18:34:01,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:01,782 INFO L462 AbstractCegarLoop]: Abstraction has 1277 states and 1746 transitions. [2019-12-07 18:34:01,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:34:01,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1746 transitions. [2019-12-07 18:34:01,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-07 18:34:01,783 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:01,784 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 18:34:01,784 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:01,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:01,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1428135620, now seen corresponding path program 1 times [2019-12-07 18:34:01,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:01,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196957623] [2019-12-07 18:34:01,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:34:01,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196957623] [2019-12-07 18:34:01,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:01,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:34:01,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892104380] [2019-12-07 18:34:01,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:34:01,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:01,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:34:01,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:34:01,853 INFO L87 Difference]: Start difference. First operand 1277 states and 1746 transitions. Second operand 4 states. [2019-12-07 18:34:04,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:04,095 INFO L93 Difference]: Finished difference Result 4360 states and 6098 transitions. [2019-12-07 18:34:04,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:34:04,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-12-07 18:34:04,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:04,111 INFO L225 Difference]: With dead ends: 4360 [2019-12-07 18:34:04,111 INFO L226 Difference]: Without dead ends: 3085 [2019-12-07 18:34:04,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:34:04,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2019-12-07 18:34:04,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 3080. [2019-12-07 18:34:04,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2019-12-07 18:34:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 3988 transitions. [2019-12-07 18:34:04,168 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 3988 transitions. Word has length 136 [2019-12-07 18:34:04,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:04,168 INFO L462 AbstractCegarLoop]: Abstraction has 3080 states and 3988 transitions. [2019-12-07 18:34:04,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:34:04,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 3988 transitions. [2019-12-07 18:34:04,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-12-07 18:34:04,171 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:04,171 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 18:34:04,172 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:04,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:04,172 INFO L82 PathProgramCache]: Analyzing trace with hash 461226345, now seen corresponding path program 1 times [2019-12-07 18:34:04,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:04,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696841440] [2019-12-07 18:34:04,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:04,316 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 127 proven. 3 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-12-07 18:34:04,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696841440] [2019-12-07 18:34:04,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728123632] [2019-12-07 18:34:04,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:34:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:04,377 INFO L264 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:34:04,385 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:34:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:34:04,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:34:04,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-12-07 18:34:04,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78058087] [2019-12-07 18:34:04,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:34:04,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:04,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:34:04,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:34:04,444 INFO L87 Difference]: Start difference. First operand 3080 states and 3988 transitions. Second operand 3 states. [2019-12-07 18:34:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:05,789 INFO L93 Difference]: Finished difference Result 8252 states and 10870 transitions. [2019-12-07 18:34:05,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:34:05,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-12-07 18:34:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:05,808 INFO L225 Difference]: With dead ends: 8252 [2019-12-07 18:34:05,808 INFO L226 Difference]: Without dead ends: 5174 [2019-12-07 18:34:05,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:34:05,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5174 states. [2019-12-07 18:34:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5174 to 4277. [2019-12-07 18:34:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4277 states. [2019-12-07 18:34:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4277 states to 4277 states and 5339 transitions. [2019-12-07 18:34:05,867 INFO L78 Accepts]: Start accepts. Automaton has 4277 states and 5339 transitions. Word has length 232 [2019-12-07 18:34:05,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:05,868 INFO L462 AbstractCegarLoop]: Abstraction has 4277 states and 5339 transitions. [2019-12-07 18:34:05,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:34:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 4277 states and 5339 transitions. [2019-12-07 18:34:05,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-12-07 18:34:05,871 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:05,872 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:06,072 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:34:06,072 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:06,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:06,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1527180443, now seen corresponding path program 1 times [2019-12-07 18:34:06,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:06,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175970021] [2019-12-07 18:34:06,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:06,419 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 18:34:06,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175970021] [2019-12-07 18:34:06,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:06,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:34:06,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511864019] [2019-12-07 18:34:06,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:34:06,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:06,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:34:06,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:34:06,421 INFO L87 Difference]: Start difference. First operand 4277 states and 5339 transitions. Second operand 5 states. [2019-12-07 18:34:09,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:09,541 INFO L93 Difference]: Finished difference Result 9452 states and 11656 transitions. [2019-12-07 18:34:09,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:34:09,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 338 [2019-12-07 18:34:09,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:09,564 INFO L225 Difference]: With dead ends: 9452 [2019-12-07 18:34:09,564 INFO L226 Difference]: Without dead ends: 5177 [2019-12-07 18:34:09,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:34:09,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5177 states. [2019-12-07 18:34:09,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5177 to 4875. [2019-12-07 18:34:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4875 states. [2019-12-07 18:34:09,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 5967 transitions. [2019-12-07 18:34:09,632 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 5967 transitions. Word has length 338 [2019-12-07 18:34:09,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:09,632 INFO L462 AbstractCegarLoop]: Abstraction has 4875 states and 5967 transitions. [2019-12-07 18:34:09,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:34:09,632 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 5967 transitions. [2019-12-07 18:34:09,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-12-07 18:34:09,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:09,638 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:09,638 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:09,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:09,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1227352119, now seen corresponding path program 1 times [2019-12-07 18:34:09,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:09,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855694263] [2019-12-07 18:34:09,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 18:34:09,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855694263] [2019-12-07 18:34:09,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:09,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:34:09,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430634470] [2019-12-07 18:34:09,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:34:09,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:09,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:34:09,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:34:09,947 INFO L87 Difference]: Start difference. First operand 4875 states and 5967 transitions. Second operand 4 states. [2019-12-07 18:34:12,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:12,284 INFO L93 Difference]: Finished difference Result 13047 states and 16083 transitions. [2019-12-07 18:34:12,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:34:12,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 412 [2019-12-07 18:34:12,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:12,311 INFO L225 Difference]: With dead ends: 13047 [2019-12-07 18:34:12,312 INFO L226 Difference]: Without dead ends: 8174 [2019-12-07 18:34:12,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:34:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8174 states. [2019-12-07 18:34:12,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8174 to 6375. [2019-12-07 18:34:12,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6375 states. [2019-12-07 18:34:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6375 states to 6375 states and 7715 transitions. [2019-12-07 18:34:12,397 INFO L78 Accepts]: Start accepts. Automaton has 6375 states and 7715 transitions. Word has length 412 [2019-12-07 18:34:12,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:12,398 INFO L462 AbstractCegarLoop]: Abstraction has 6375 states and 7715 transitions. [2019-12-07 18:34:12,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:34:12,398 INFO L276 IsEmpty]: Start isEmpty. Operand 6375 states and 7715 transitions. [2019-12-07 18:34:12,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-12-07 18:34:12,403 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:12,404 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:12,404 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:12,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:12,404 INFO L82 PathProgramCache]: Analyzing trace with hash 2078614052, now seen corresponding path program 1 times [2019-12-07 18:34:12,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:12,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276120670] [2019-12-07 18:34:12,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 137 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:34:13,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276120670] [2019-12-07 18:34:13,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96991872] [2019-12-07 18:34:13,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:34:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:13,107 INFO L264 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:34:13,116 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:34:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:34:13,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:34:13,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-12-07 18:34:13,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579525019] [2019-12-07 18:34:13,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:34:13,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:13,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:34:13,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:34:13,217 INFO L87 Difference]: Start difference. First operand 6375 states and 7715 transitions. Second operand 3 states. [2019-12-07 18:34:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:14,823 INFO L93 Difference]: Finished difference Result 13347 states and 16095 transitions. [2019-12-07 18:34:14,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:34:14,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 417 [2019-12-07 18:34:14,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:14,842 INFO L225 Difference]: With dead ends: 13347 [2019-12-07 18:34:14,843 INFO L226 Difference]: Without dead ends: 6974 [2019-12-07 18:34:14,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 417 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:34:14,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6974 states. [2019-12-07 18:34:14,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6974 to 6673. [2019-12-07 18:34:14,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6673 states. [2019-12-07 18:34:14,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6673 states to 6673 states and 7850 transitions. [2019-12-07 18:34:14,906 INFO L78 Accepts]: Start accepts. Automaton has 6673 states and 7850 transitions. Word has length 417 [2019-12-07 18:34:14,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:14,907 INFO L462 AbstractCegarLoop]: Abstraction has 6673 states and 7850 transitions. [2019-12-07 18:34:14,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:34:14,907 INFO L276 IsEmpty]: Start isEmpty. Operand 6673 states and 7850 transitions. [2019-12-07 18:34:14,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2019-12-07 18:34:14,909 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:14,910 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:15,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:34:15,110 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:15,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:15,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1305480874, now seen corresponding path program 1 times [2019-12-07 18:34:15,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:15,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291843085] [2019-12-07 18:34:15,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-12-07 18:34:15,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291843085] [2019-12-07 18:34:15,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:15,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:34:15,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199941058] [2019-12-07 18:34:15,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:34:15,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:15,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:34:15,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:34:15,295 INFO L87 Difference]: Start difference. First operand 6673 states and 7850 transitions. Second operand 4 states. [2019-12-07 18:34:17,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:17,208 INFO L93 Difference]: Finished difference Result 13344 states and 15700 transitions. [2019-12-07 18:34:17,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:34:17,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 434 [2019-12-07 18:34:17,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:17,216 INFO L225 Difference]: With dead ends: 13344 [2019-12-07 18:34:17,216 INFO L226 Difference]: Without dead ends: 6673 [2019-12-07 18:34:17,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:34:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6673 states. [2019-12-07 18:34:17,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6673 to 6672. [2019-12-07 18:34:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6672 states. [2019-12-07 18:34:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6672 states to 6672 states and 7565 transitions. [2019-12-07 18:34:17,265 INFO L78 Accepts]: Start accepts. Automaton has 6672 states and 7565 transitions. Word has length 434 [2019-12-07 18:34:17,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:17,266 INFO L462 AbstractCegarLoop]: Abstraction has 6672 states and 7565 transitions. [2019-12-07 18:34:17,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:34:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 6672 states and 7565 transitions. [2019-12-07 18:34:17,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2019-12-07 18:34:17,269 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:17,270 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:17,270 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:17,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:17,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1447157885, now seen corresponding path program 1 times [2019-12-07 18:34:17,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:17,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298017890] [2019-12-07 18:34:17,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-12-07 18:34:17,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298017890] [2019-12-07 18:34:17,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:17,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:34:17,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174308826] [2019-12-07 18:34:17,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:34:17,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:17,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:34:17,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:34:17,520 INFO L87 Difference]: Start difference. First operand 6672 states and 7565 transitions. Second operand 3 states. [2019-12-07 18:34:19,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:19,405 INFO L93 Difference]: Finished difference Result 15733 states and 18096 transitions. [2019-12-07 18:34:19,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:34:19,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 530 [2019-12-07 18:34:19,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:19,417 INFO L225 Difference]: With dead ends: 15733 [2019-12-07 18:34:19,418 INFO L226 Difference]: Without dead ends: 9063 [2019-12-07 18:34:19,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:34:19,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9063 states. [2019-12-07 18:34:19,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9063 to 9063. [2019-12-07 18:34:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9063 states. [2019-12-07 18:34:19,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 10362 transitions. [2019-12-07 18:34:19,497 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 10362 transitions. Word has length 530 [2019-12-07 18:34:19,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:19,498 INFO L462 AbstractCegarLoop]: Abstraction has 9063 states and 10362 transitions. [2019-12-07 18:34:19,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:34:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 10362 transitions. [2019-12-07 18:34:19,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2019-12-07 18:34:19,504 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:19,504 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:19,504 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:19,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:19,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1866992391, now seen corresponding path program 1 times [2019-12-07 18:34:19,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:19,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423286102] [2019-12-07 18:34:19,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 660 proven. 3 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-12-07 18:34:20,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423286102] [2019-12-07 18:34:20,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58018150] [2019-12-07 18:34:20,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:34:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:20,606 INFO L264 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 18:34:20,612 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:34:20,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:34:21,020 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 624 proven. 39 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-12-07 18:34:21,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:34:21,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-12-07 18:34:21,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750975857] [2019-12-07 18:34:21,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:34:21,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:21,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:34:21,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:34:21,022 INFO L87 Difference]: Start difference. First operand 9063 states and 10362 transitions. Second operand 9 states. [2019-12-07 18:34:26,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:26,865 INFO L93 Difference]: Finished difference Result 23362 states and 26503 transitions. [2019-12-07 18:34:26,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:34:26,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 621 [2019-12-07 18:34:26,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:26,874 INFO L225 Difference]: With dead ends: 23362 [2019-12-07 18:34:26,874 INFO L226 Difference]: Without dead ends: 10856 [2019-12-07 18:34:26,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 619 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:34:26,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10856 states. [2019-12-07 18:34:26,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10856 to 7865. [2019-12-07 18:34:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7865 states. [2019-12-07 18:34:26,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7865 states to 7865 states and 8367 transitions. [2019-12-07 18:34:26,951 INFO L78 Accepts]: Start accepts. Automaton has 7865 states and 8367 transitions. Word has length 621 [2019-12-07 18:34:26,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:26,952 INFO L462 AbstractCegarLoop]: Abstraction has 7865 states and 8367 transitions. [2019-12-07 18:34:26,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:34:26,952 INFO L276 IsEmpty]: Start isEmpty. Operand 7865 states and 8367 transitions. [2019-12-07 18:34:26,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2019-12-07 18:34:26,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:26,957 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:27,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:34:27,158 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:27,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:27,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1111780767, now seen corresponding path program 1 times [2019-12-07 18:34:27,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:27,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118689663] [2019-12-07 18:34:27,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:27,498 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2019-12-07 18:34:27,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118689663] [2019-12-07 18:34:27,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:27,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:34:27,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733577243] [2019-12-07 18:34:27,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:34:27,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:27,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:34:27,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:34:27,500 INFO L87 Difference]: Start difference. First operand 7865 states and 8367 transitions. Second operand 3 states. [2019-12-07 18:34:28,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:28,409 INFO L93 Difference]: Finished difference Result 15726 states and 16730 transitions. [2019-12-07 18:34:28,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:34:28,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 663 [2019-12-07 18:34:28,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:28,414 INFO L225 Difference]: With dead ends: 15726 [2019-12-07 18:34:28,414 INFO L226 Difference]: Without dead ends: 7863 [2019-12-07 18:34:28,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:34:28,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7863 states. [2019-12-07 18:34:28,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7863 to 7863. [2019-12-07 18:34:28,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7863 states. [2019-12-07 18:34:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7863 states to 7863 states and 8363 transitions. [2019-12-07 18:34:28,468 INFO L78 Accepts]: Start accepts. Automaton has 7863 states and 8363 transitions. Word has length 663 [2019-12-07 18:34:28,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:28,468 INFO L462 AbstractCegarLoop]: Abstraction has 7863 states and 8363 transitions. [2019-12-07 18:34:28,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:34:28,468 INFO L276 IsEmpty]: Start isEmpty. Operand 7863 states and 8363 transitions. [2019-12-07 18:34:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2019-12-07 18:34:28,473 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:28,473 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:28,474 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:28,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:28,474 INFO L82 PathProgramCache]: Analyzing trace with hash 696170776, now seen corresponding path program 1 times [2019-12-07 18:34:28,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:28,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227007347] [2019-12-07 18:34:28,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 525 proven. 201 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-12-07 18:34:29,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227007347] [2019-12-07 18:34:29,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029360709] [2019-12-07 18:34:29,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:34:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:29,324 INFO L264 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:34:29,329 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:34:29,576 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-12-07 18:34:29,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:34:29,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-12-07 18:34:29,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739602464] [2019-12-07 18:34:29,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:34:29,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:29,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:34:29,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:34:29,577 INFO L87 Difference]: Start difference. First operand 7863 states and 8363 transitions. Second operand 3 states. [2019-12-07 18:34:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:30,671 INFO L93 Difference]: Finished difference Result 15725 states and 16726 transitions. [2019-12-07 18:34:30,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:34:30,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 676 [2019-12-07 18:34:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:30,679 INFO L225 Difference]: With dead ends: 15725 [2019-12-07 18:34:30,679 INFO L226 Difference]: Without dead ends: 7864 [2019-12-07 18:34:30,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 677 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:34:30,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7864 states. [2019-12-07 18:34:30,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7864 to 7861. [2019-12-07 18:34:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7861 states. [2019-12-07 18:34:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7861 states to 7861 states and 8288 transitions. [2019-12-07 18:34:30,739 INFO L78 Accepts]: Start accepts. Automaton has 7861 states and 8288 transitions. Word has length 676 [2019-12-07 18:34:30,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:30,740 INFO L462 AbstractCegarLoop]: Abstraction has 7861 states and 8288 transitions. [2019-12-07 18:34:30,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:34:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 7861 states and 8288 transitions. [2019-12-07 18:34:30,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2019-12-07 18:34:30,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:30,745 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:30,946 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:34:30,947 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:30,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:30,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1189188974, now seen corresponding path program 1 times [2019-12-07 18:34:30,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:30,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366140527] [2019-12-07 18:34:30,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:31,452 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 545 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 18:34:31,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366140527] [2019-12-07 18:34:31,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:31,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:34:31,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967523674] [2019-12-07 18:34:31,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:34:31,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:31,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:34:31,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:34:31,454 INFO L87 Difference]: Start difference. First operand 7861 states and 8288 transitions. Second operand 4 states. [2019-12-07 18:34:33,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:33,443 INFO L93 Difference]: Finished difference Result 16276 states and 17083 transitions. [2019-12-07 18:34:33,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:34:33,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 691 [2019-12-07 18:34:33,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:33,448 INFO L225 Difference]: With dead ends: 16276 [2019-12-07 18:34:33,449 INFO L226 Difference]: Without dead ends: 7819 [2019-12-07 18:34:33,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:34:33,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7819 states. [2019-12-07 18:34:33,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7819 to 6320. [2019-12-07 18:34:33,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6320 states. [2019-12-07 18:34:33,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6320 states to 6320 states and 6499 transitions. [2019-12-07 18:34:33,493 INFO L78 Accepts]: Start accepts. Automaton has 6320 states and 6499 transitions. Word has length 691 [2019-12-07 18:34:33,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:33,493 INFO L462 AbstractCegarLoop]: Abstraction has 6320 states and 6499 transitions. [2019-12-07 18:34:33,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:34:33,493 INFO L276 IsEmpty]: Start isEmpty. Operand 6320 states and 6499 transitions. [2019-12-07 18:34:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2019-12-07 18:34:33,498 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:33,499 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:33,499 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:33,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:33,500 INFO L82 PathProgramCache]: Analyzing trace with hash 2083360250, now seen corresponding path program 1 times [2019-12-07 18:34:33,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:33,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674738074] [2019-12-07 18:34:33,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:34,337 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 85 proven. 804 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:34:34,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674738074] [2019-12-07 18:34:34,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433041847] [2019-12-07 18:34:34,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:34:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:34,468 INFO L264 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:34:34,473 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:34:34,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:34:34,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:34:34,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:34:34,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:34:34,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:34:34,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:34:34,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:34:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2019-12-07 18:34:35,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:34:35,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2019-12-07 18:34:35,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700460251] [2019-12-07 18:34:35,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:34:35,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:35,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:34:35,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:34:35,085 INFO L87 Difference]: Start difference. First operand 6320 states and 6499 transitions. Second operand 3 states. [2019-12-07 18:34:57,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:57,478 INFO L93 Difference]: Finished difference Result 15043 states and 15511 transitions. [2019-12-07 18:34:57,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:34:57,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 698 [2019-12-07 18:34:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:57,484 INFO L225 Difference]: With dead ends: 15043 [2019-12-07 18:34:57,484 INFO L226 Difference]: Without dead ends: 8725 [2019-12-07 18:34:57,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:34:57,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8725 states. [2019-12-07 18:34:57,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8725 to 8120. [2019-12-07 18:34:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8120 states. [2019-12-07 18:34:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8120 states to 8120 states and 8371 transitions. [2019-12-07 18:34:57,537 INFO L78 Accepts]: Start accepts. Automaton has 8120 states and 8371 transitions. Word has length 698 [2019-12-07 18:34:57,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:57,538 INFO L462 AbstractCegarLoop]: Abstraction has 8120 states and 8371 transitions. [2019-12-07 18:34:57,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:34:57,538 INFO L276 IsEmpty]: Start isEmpty. Operand 8120 states and 8371 transitions. [2019-12-07 18:34:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 909 [2019-12-07 18:34:57,547 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:57,548 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, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 18:34:57,748 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:34:57,749 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:57,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:57,750 INFO L82 PathProgramCache]: Analyzing trace with hash -384171549, now seen corresponding path program 1 times [2019-12-07 18:34:57,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:57,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604141450] [2019-12-07 18:34:57,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:58,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1464 backedges. 888 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-12-07 18:34:58,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604141450] [2019-12-07 18:34:58,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:58,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:34:58,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161705558] [2019-12-07 18:34:58,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:34:58,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:58,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:34:58,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:34:58,501 INFO L87 Difference]: Start difference. First operand 8120 states and 8371 transitions. Second operand 3 states. [2019-12-07 18:34:59,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:59,256 INFO L93 Difference]: Finished difference Result 19526 states and 20169 transitions. [2019-12-07 18:34:59,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:34:59,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 908 [2019-12-07 18:34:59,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:59,265 INFO L225 Difference]: With dead ends: 19526 [2019-12-07 18:34:59,265 INFO L226 Difference]: Without dead ends: 11707 [2019-12-07 18:34:59,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:34:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11707 states. [2019-12-07 18:34:59,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11707 to 10212. [2019-12-07 18:34:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10212 states. [2019-12-07 18:34:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10212 states to 10212 states and 10499 transitions. [2019-12-07 18:34:59,338 INFO L78 Accepts]: Start accepts. Automaton has 10212 states and 10499 transitions. Word has length 908 [2019-12-07 18:34:59,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:59,339 INFO L462 AbstractCegarLoop]: Abstraction has 10212 states and 10499 transitions. [2019-12-07 18:34:59,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:34:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 10212 states and 10499 transitions. [2019-12-07 18:34:59,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2019-12-07 18:34:59,349 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:59,350 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 18:34:59,350 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:59,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:59,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1617243607, now seen corresponding path program 1 times [2019-12-07 18:34:59,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:59,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725347566] [2019-12-07 18:34:59,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1272 backedges. 838 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-12-07 18:34:59,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725347566] [2019-12-07 18:34:59,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:59,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:34:59,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236037249] [2019-12-07 18:34:59,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:34:59,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:59,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:34:59,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:34:59,955 INFO L87 Difference]: Start difference. First operand 10212 states and 10499 transitions. Second operand 3 states. [2019-12-07 18:35:00,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:00,693 INFO L93 Difference]: Finished difference Result 22819 states and 23483 transitions. [2019-12-07 18:35:00,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:00,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 922 [2019-12-07 18:35:00,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:00,701 INFO L225 Difference]: With dead ends: 22819 [2019-12-07 18:35:00,701 INFO L226 Difference]: Without dead ends: 12908 [2019-12-07 18:35:00,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12908 states. [2019-12-07 18:35:00,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12908 to 12303. [2019-12-07 18:35:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12303 states. [2019-12-07 18:35:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12303 states to 12303 states and 12652 transitions. [2019-12-07 18:35:00,793 INFO L78 Accepts]: Start accepts. Automaton has 12303 states and 12652 transitions. Word has length 922 [2019-12-07 18:35:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:00,793 INFO L462 AbstractCegarLoop]: Abstraction has 12303 states and 12652 transitions. [2019-12-07 18:35:00,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 12303 states and 12652 transitions. [2019-12-07 18:35:00,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1044 [2019-12-07 18:35:00,808 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:00,808 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:00,808 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:00,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:00,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1236328096, now seen corresponding path program 1 times [2019-12-07 18:35:00,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:00,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338460155] [2019-12-07 18:35:00,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:02,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1594 backedges. 77 proven. 1322 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-12-07 18:35:02,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338460155] [2019-12-07 18:35:02,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015319353] [2019-12-07 18:35:02,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:02,872 INFO L264 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:35:02,879 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:04,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1594 backedges. 64 proven. 897 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-12-07 18:35:04,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:35:04,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 10 [2019-12-07 18:35:04,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350540967] [2019-12-07 18:35:04,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:35:04,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:04,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:35:04,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:35:04,065 INFO L87 Difference]: Start difference. First operand 12303 states and 12652 transitions. Second operand 11 states. [2019-12-07 18:35:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:12,116 INFO L93 Difference]: Finished difference Result 47712 states and 49202 transitions. [2019-12-07 18:35:12,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 18:35:12,117 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1043 [2019-12-07 18:35:12,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:12,150 INFO L225 Difference]: With dead ends: 47712 [2019-12-07 18:35:12,150 INFO L226 Difference]: Without dead ends: 35710 [2019-12-07 18:35:12,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1060 GetRequests, 1040 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:35:12,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35710 states. [2019-12-07 18:35:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35710 to 21291. [2019-12-07 18:35:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21291 states. [2019-12-07 18:35:12,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21291 states to 21291 states and 21929 transitions. [2019-12-07 18:35:12,372 INFO L78 Accepts]: Start accepts. Automaton has 21291 states and 21929 transitions. Word has length 1043 [2019-12-07 18:35:12,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:12,373 INFO L462 AbstractCegarLoop]: Abstraction has 21291 states and 21929 transitions. [2019-12-07 18:35:12,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:35:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand 21291 states and 21929 transitions. [2019-12-07 18:35:12,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1697 [2019-12-07 18:35:12,400 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:12,400 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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 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-12-07 18:35:12,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:12,602 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:12,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:12,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1576812717, now seen corresponding path program 1 times [2019-12-07 18:35:12,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:12,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311064896] [2019-12-07 18:35:12,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:14,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4776 backedges. 2598 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2019-12-07 18:35:14,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311064896] [2019-12-07 18:35:14,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:14,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:35:14,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78753473] [2019-12-07 18:35:14,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:35:14,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:14,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:35:14,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:14,043 INFO L87 Difference]: Start difference. First operand 21291 states and 21929 transitions. Second operand 3 states. [2019-12-07 18:35:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:14,735 INFO L93 Difference]: Finished difference Result 39884 states and 41102 transitions. [2019-12-07 18:35:14,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:35:14,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1696 [2019-12-07 18:35:14,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:14,747 INFO L225 Difference]: With dead ends: 39884 [2019-12-07 18:35:14,747 INFO L226 Difference]: Without dead ends: 21589 [2019-12-07 18:35:14,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:35:14,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21589 states. [2019-12-07 18:35:14,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21589 to 21290. [2019-12-07 18:35:14,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21290 states. [2019-12-07 18:35:14,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21290 states to 21290 states and 21927 transitions. [2019-12-07 18:35:14,904 INFO L78 Accepts]: Start accepts. Automaton has 21290 states and 21927 transitions. Word has length 1696 [2019-12-07 18:35:14,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:14,904 INFO L462 AbstractCegarLoop]: Abstraction has 21290 states and 21927 transitions. [2019-12-07 18:35:14,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:35:14,904 INFO L276 IsEmpty]: Start isEmpty. Operand 21290 states and 21927 transitions. [2019-12-07 18:35:14,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2073 [2019-12-07 18:35:14,930 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:14,931 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, 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 18:35:14,931 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:14,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:14,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1956119995, now seen corresponding path program 1 times [2019-12-07 18:35:14,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:14,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024322115] [2019-12-07 18:35:14,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7195 backedges. 3635 proven. 0 refuted. 0 times theorem prover too weak. 3560 trivial. 0 not checked. [2019-12-07 18:35:17,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024322115] [2019-12-07 18:35:17,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:35:17,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:35:17,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698926016] [2019-12-07 18:35:17,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:35:17,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:17,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:35:17,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:35:17,040 INFO L87 Difference]: Start difference. First operand 21290 states and 21927 transitions. Second operand 4 states. [2019-12-07 18:35:18,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:18,130 INFO L93 Difference]: Finished difference Result 41680 states and 42931 transitions. [2019-12-07 18:35:18,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:35:18,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2072 [2019-12-07 18:35:18,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:18,141 INFO L225 Difference]: With dead ends: 41680 [2019-12-07 18:35:18,142 INFO L226 Difference]: Without dead ends: 20990 [2019-12-07 18:35:18,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:35:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20990 states. [2019-12-07 18:35:18,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20990 to 16796. [2019-12-07 18:35:18,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16796 states. [2019-12-07 18:35:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16796 states to 16796 states and 17146 transitions. [2019-12-07 18:35:18,289 INFO L78 Accepts]: Start accepts. Automaton has 16796 states and 17146 transitions. Word has length 2072 [2019-12-07 18:35:18,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:18,290 INFO L462 AbstractCegarLoop]: Abstraction has 16796 states and 17146 transitions. [2019-12-07 18:35:18,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:35:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 16796 states and 17146 transitions. [2019-12-07 18:35:18,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2225 [2019-12-07 18:35:18,317 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:35:18,317 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, 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, 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, 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, 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, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:35:18,318 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:35:18,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:35:18,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1095182389, now seen corresponding path program 1 times [2019-12-07 18:35:18,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:35:18,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285851237] [2019-12-07 18:35:18,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:35:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:23,260 INFO L134 CoverageAnalysis]: Checked inductivity of 9209 backedges. 5753 proven. 1802 refuted. 0 times theorem prover too weak. 1654 trivial. 0 not checked. [2019-12-07 18:35:23,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285851237] [2019-12-07 18:35:23,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8571560] [2019-12-07 18:35:23,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:35:23,640 INFO L264 TraceCheckSpWp]: Trace formula consists of 2517 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 18:35:23,653 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:35:23,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:35:23,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:35:23,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:35:26,798 INFO L134 CoverageAnalysis]: Checked inductivity of 9209 backedges. 6292 proven. 152 refuted. 0 times theorem prover too weak. 2765 trivial. 0 not checked. [2019-12-07 18:35:26,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:35:26,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-12-07 18:35:26,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580684546] [2019-12-07 18:35:26,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:35:26,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:35:26,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:35:26,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:35:26,802 INFO L87 Difference]: Start difference. First operand 16796 states and 17146 transitions. Second operand 15 states. [2019-12-07 18:35:34,814 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-12-07 18:35:45,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:35:45,877 INFO L93 Difference]: Finished difference Result 40329 states and 41183 transitions. [2019-12-07 18:35:45,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-07 18:35:45,879 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 2224 [2019-12-07 18:35:45,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:35:45,881 INFO L225 Difference]: With dead ends: 40329 [2019-12-07 18:35:45,882 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:35:45,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2313 GetRequests, 2256 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=643, Invalid=2663, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 18:35:45,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:35:45,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:35:45,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:35:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:35:45,898 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2224 [2019-12-07 18:35:45,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:35:45,898 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:35:45,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:35:45,898 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:35:45,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:35:46,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:35:46,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 18:35:46,741 WARN L192 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 519 DAG size of output: 443 [2019-12-07 18:35:47,278 WARN L192 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 519 DAG size of output: 443 [2019-12-07 18:35:47,588 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 473 DAG size of output: 414 [2019-12-07 18:35:50,365 WARN L192 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 429 DAG size of output: 151 [2019-12-07 18:35:53,457 WARN L192 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 429 DAG size of output: 151 [2019-12-07 18:35:56,549 WARN L192 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 400 DAG size of output: 153 [2019-12-07 18:35:56,556 INFO L246 CegarLoopResult]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,557 INFO L246 CegarLoopResult]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,557 INFO L246 CegarLoopResult]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,557 INFO L246 CegarLoopResult]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,557 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 18:35:56,557 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,557 INFO L246 CegarLoopResult]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,557 INFO L246 CegarLoopResult]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,558 INFO L246 CegarLoopResult]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,558 INFO L246 CegarLoopResult]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,558 INFO L246 CegarLoopResult]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,558 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 18:35:56,558 INFO L246 CegarLoopResult]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,558 INFO L246 CegarLoopResult]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,558 INFO L246 CegarLoopResult]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,558 INFO L246 CegarLoopResult]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-12-07 18:35:56,559 INFO L246 CegarLoopResult]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,559 INFO L246 CegarLoopResult]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,559 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 18:35:56,559 INFO L246 CegarLoopResult]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,559 INFO L246 CegarLoopResult]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,559 INFO L246 CegarLoopResult]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,559 INFO L246 CegarLoopResult]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,559 INFO L246 CegarLoopResult]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,560 INFO L246 CegarLoopResult]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,560 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 18:35:56,560 INFO L246 CegarLoopResult]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,560 INFO L246 CegarLoopResult]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,560 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,560 INFO L246 CegarLoopResult]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,560 INFO L246 CegarLoopResult]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-12-07 18:35:56,560 INFO L246 CegarLoopResult]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-12-07 18:35:56,561 INFO L246 CegarLoopResult]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,561 INFO L246 CegarLoopResult]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,561 INFO L246 CegarLoopResult]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,561 INFO L246 CegarLoopResult]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,561 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 18:35:56,561 INFO L246 CegarLoopResult]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-12-07 18:35:56,561 INFO L246 CegarLoopResult]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,561 INFO L246 CegarLoopResult]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,562 INFO L246 CegarLoopResult]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,562 INFO L246 CegarLoopResult]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,562 INFO L246 CegarLoopResult]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,562 INFO L246 CegarLoopResult]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 18:35:56,562 INFO L246 CegarLoopResult]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,562 INFO L246 CegarLoopResult]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 18:35:56,562 INFO L246 CegarLoopResult]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 18:35:56,562 INFO L246 CegarLoopResult]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 18:35:56,563 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 18:35:56,563 INFO L246 CegarLoopResult]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,563 INFO L246 CegarLoopResult]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,563 INFO L246 CegarLoopResult]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,563 INFO L246 CegarLoopResult]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,563 INFO L246 CegarLoopResult]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,563 INFO L246 CegarLoopResult]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-12-07 18:35:56,563 INFO L246 CegarLoopResult]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,564 INFO L246 CegarLoopResult]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,564 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 18:35:56,564 INFO L246 CegarLoopResult]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,564 INFO L246 CegarLoopResult]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-12-07 18:35:56,564 INFO L246 CegarLoopResult]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,564 INFO L246 CegarLoopResult]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,564 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,564 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 18:35:56,564 INFO L246 CegarLoopResult]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,565 INFO L246 CegarLoopResult]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 18:35:56,565 INFO L246 CegarLoopResult]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 18:35:56,565 INFO L246 CegarLoopResult]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-12-07 18:35:56,565 INFO L246 CegarLoopResult]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-12-07 18:35:56,565 INFO L246 CegarLoopResult]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 18:35:56,565 INFO L246 CegarLoopResult]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 18:35:56,565 INFO L246 CegarLoopResult]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,566 INFO L246 CegarLoopResult]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,566 INFO L246 CegarLoopResult]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,566 INFO L246 CegarLoopResult]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,566 INFO L246 CegarLoopResult]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-12-07 18:35:56,566 INFO L246 CegarLoopResult]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-12-07 18:35:56,566 INFO L246 CegarLoopResult]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,566 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 18:35:56,566 INFO L246 CegarLoopResult]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,567 INFO L246 CegarLoopResult]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,567 INFO L246 CegarLoopResult]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,567 INFO L246 CegarLoopResult]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,567 INFO L246 CegarLoopResult]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,567 INFO L246 CegarLoopResult]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,567 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 18:35:56,567 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 18:35:56,568 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 205) no Hoare annotation was computed. [2019-12-07 18:35:56,568 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,568 INFO L246 CegarLoopResult]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,568 INFO L246 CegarLoopResult]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,568 INFO L246 CegarLoopResult]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,568 INFO L246 CegarLoopResult]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,568 INFO L246 CegarLoopResult]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 18:35:56,568 INFO L246 CegarLoopResult]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 18:35:56,569 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,569 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 18:35:56,569 INFO L246 CegarLoopResult]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-12-07 18:35:56,569 INFO L246 CegarLoopResult]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-12-07 18:35:56,569 INFO L246 CegarLoopResult]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,569 INFO L246 CegarLoopResult]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-12-07 18:35:56,569 INFO L246 CegarLoopResult]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-12-07 18:35:56,570 INFO L246 CegarLoopResult]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,570 INFO L246 CegarLoopResult]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,570 INFO L246 CegarLoopResult]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,570 INFO L246 CegarLoopResult]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,570 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 18:35:56,570 INFO L246 CegarLoopResult]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-12-07 18:35:56,570 INFO L246 CegarLoopResult]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,570 INFO L246 CegarLoopResult]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,571 INFO L246 CegarLoopResult]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,571 INFO L246 CegarLoopResult]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 18:35:56,571 INFO L246 CegarLoopResult]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 18:35:56,571 INFO L246 CegarLoopResult]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,571 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 18:35:56,571 INFO L246 CegarLoopResult]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,571 INFO L246 CegarLoopResult]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,571 INFO L246 CegarLoopResult]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,572 INFO L246 CegarLoopResult]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,572 INFO L246 CegarLoopResult]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,572 INFO L246 CegarLoopResult]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,572 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 18:35:56,572 INFO L246 CegarLoopResult]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,572 INFO L246 CegarLoopResult]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,572 INFO L246 CegarLoopResult]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-12-07 18:35:56,572 INFO L246 CegarLoopResult]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,573 INFO L246 CegarLoopResult]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,573 INFO L246 CegarLoopResult]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,573 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,573 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 18:35:56,573 INFO L246 CegarLoopResult]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,573 INFO L246 CegarLoopResult]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,573 INFO L246 CegarLoopResult]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,573 INFO L246 CegarLoopResult]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,574 INFO L246 CegarLoopResult]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,574 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 18:35:56,574 INFO L246 CegarLoopResult]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,574 INFO L246 CegarLoopResult]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,574 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,574 INFO L246 CegarLoopResult]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,574 INFO L246 CegarLoopResult]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-12-07 18:35:56,574 INFO L246 CegarLoopResult]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,575 INFO L246 CegarLoopResult]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,575 INFO L246 CegarLoopResult]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,575 INFO L246 CegarLoopResult]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-12-07 18:35:56,575 INFO L246 CegarLoopResult]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-12-07 18:35:56,575 INFO L246 CegarLoopResult]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,575 INFO L246 CegarLoopResult]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,575 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 18:35:56,575 INFO L246 CegarLoopResult]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,576 INFO L246 CegarLoopResult]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,576 INFO L246 CegarLoopResult]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,576 INFO L246 CegarLoopResult]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,576 INFO L246 CegarLoopResult]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,576 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 18:35:56,576 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,576 INFO L246 CegarLoopResult]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,576 INFO L246 CegarLoopResult]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,576 INFO L246 CegarLoopResult]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,577 INFO L246 CegarLoopResult]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,577 INFO L246 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-12-07 18:35:56,577 INFO L246 CegarLoopResult]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,577 INFO L246 CegarLoopResult]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,577 INFO L246 CegarLoopResult]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-12-07 18:35:56,577 INFO L246 CegarLoopResult]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,577 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 18:35:56,577 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 18:35:56,577 INFO L246 CegarLoopResult]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,577 INFO L246 CegarLoopResult]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,577 INFO L246 CegarLoopResult]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,577 INFO L246 CegarLoopResult]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,577 INFO L246 CegarLoopResult]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,577 INFO L246 CegarLoopResult]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 18:35:56,577 INFO L246 CegarLoopResult]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 18:35:56,577 INFO L246 CegarLoopResult]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,577 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 18:35:56,577 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 18:35:56,577 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 18:35:56,577 INFO L246 CegarLoopResult]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-12-07 18:35:56,578 INFO L246 CegarLoopResult]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-12-07 18:35:56,579 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 18:35:56,579 INFO L246 CegarLoopResult]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,579 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 18:35:56,579 INFO L246 CegarLoopResult]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,579 INFO L246 CegarLoopResult]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,579 INFO L246 CegarLoopResult]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,579 INFO L246 CegarLoopResult]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,579 INFO L246 CegarLoopResult]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,579 INFO L246 CegarLoopResult]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,579 INFO L246 CegarLoopResult]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,579 INFO L246 CegarLoopResult]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,579 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 18:35:56,579 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 18:35:56,579 INFO L246 CegarLoopResult]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-12-07 18:35:56,579 INFO L246 CegarLoopResult]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-12-07 18:35:56,579 INFO L246 CegarLoopResult]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,579 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,579 INFO L246 CegarLoopResult]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,579 INFO L246 CegarLoopResult]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,580 INFO L242 CegarLoopResult]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse34 (+ ~a0~0 61)) (.cse28 (+ ~a4~0 86))) (let ((.cse5 (= 3 ~a2~0)) (.cse7 (<= .cse28 0)) (.cse30 (< 0 .cse34)) (.cse9 (+ ~a0~0 44)) (.cse8 (<= (* 10 ~a29~0) (+ (* 9 ~a0~0) 806))) (.cse18 (<= ~a29~0 43))) (let ((.cse2 (< 0 (+ ~a0~0 147))) (.cse21 (<= .cse34 0)) (.cse23 (or .cse8 .cse18)) (.cse24 (exists ((v_prenex_1 Int)) (let ((.cse33 (* v_prenex_1 9))) (let ((.cse31 (+ (div .cse33 10) 1))) (let ((.cse32 (mod .cse31 29))) (and (< .cse31 0) (<= .cse32 (+ ~a29~0 15)) (not (= (mod .cse33 10) 0)) (not (= 0 .cse32)) (< (* 9 v_prenex_1) 0))))))) (.cse14 (<= 0 .cse9)) (.cse25 (<= 2 ~a2~0)) (.cse26 (<= ~a2~0 2)) (.cse1 (<= (+ ~a0~0 99) 0)) (.cse27 (exists ((v_~a29~0_895 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_895 299928)) (< 43 v_~a29~0_895) (<= 0 v_~a29~0_895)))) (.cse20 (or .cse7 .cse30)) (.cse17 (<= (+ ~a29~0 16) 0)) (.cse3 (= 4 ~a2~0)) (.cse22 (let ((.cse29 (not .cse5))) (or (and .cse7 (not (= 2 ~a2~0)) .cse29) (and .cse7 .cse30 .cse29)))) (.cse19 (= 5 ~a2~0)) (.cse15 (<= (+ ~a0~0 98) 0)) (.cse13 (<= 0 (+ ~a0~0 595421))) (.cse6 (< 43 ~a29~0)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse12 (<= ~a29~0 41)) (.cse16 (< 0 .cse28)) (.cse10 (= 1 ~a2~0)) (.cse11 (< 0 (+ ~a29~0 144))) (.cse4 (<= 0 (+ ~a0~0 595423)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5) (and .cse0 .cse1 .cse5 .cse6) (and .cse7 .cse8 (= .cse9 0) .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse13 .cse3) (and .cse0 .cse14 .cse5 .cse6) (and .cse15 .cse0 .cse16 .cse10 .cse2) (and .cse7 .cse15) (and .cse0 .cse1 .cse17 .cse11 .cse5) (and .cse7 (<= 4696 ~a0~0) .cse18 .cse3) (and .cse15 .cse0 .cse4 .cse19) (and .cse0 .cse1 .cse4 .cse3 .cse6) (and .cse20 .cse5 .cse21) (and .cse22 .cse14 .cse19 .cse6) (and .cse7 .cse23 .cse18 .cse3 (<= 0 (+ ~a0~0 54)) .cse24) (and .cse22 .cse21) (and .cse12 .cse0 .cse20 .cse14 .cse5) (and .cse7 .cse21 .cse24) (and .cse7 .cse23 .cse12 .cse3 .cse24) (and .cse25 .cse22 .cse26 .cse14) (and .cse25 .cse15 .cse0 .cse26 .cse4) (and .cse0 .cse27 .cse1 .cse5) (and (or .cse16 (not (= 1 ULTIMATE.start_calculate_output_~input))) .cse0 .cse27 .cse20 .cse5) (and .cse7 .cse17 .cse11 .cse3) (and .cse12 .cse22 .cse19) (and .cse15 .cse0 .cse16 .cse10 .cse13 .cse6) (and .cse0 .cse12 .cse16 .cse10 .cse11 .cse4))))) [2019-12-07 18:35:56,580 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 18:35:56,580 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 18:35:56,580 INFO L246 CegarLoopResult]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,580 INFO L246 CegarLoopResult]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,580 INFO L246 CegarLoopResult]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,580 INFO L246 CegarLoopResult]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,580 INFO L246 CegarLoopResult]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,580 INFO L246 CegarLoopResult]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,580 INFO L246 CegarLoopResult]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,580 INFO L246 CegarLoopResult]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 18:35:56,580 INFO L246 CegarLoopResult]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,580 INFO L246 CegarLoopResult]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 18:35:56,581 INFO L249 CegarLoopResult]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-12-07 18:35:56,581 INFO L246 CegarLoopResult]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,581 INFO L246 CegarLoopResult]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-12-07 18:35:56,581 INFO L246 CegarLoopResult]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-12-07 18:35:56,581 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 18:35:56,581 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 18:35:56,581 INFO L246 CegarLoopResult]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,581 INFO L246 CegarLoopResult]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,581 INFO L246 CegarLoopResult]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,581 INFO L246 CegarLoopResult]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,581 INFO L246 CegarLoopResult]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,581 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 18:35:56,581 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 18:35:56,581 INFO L246 CegarLoopResult]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,581 INFO L246 CegarLoopResult]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-12-07 18:35:56,581 INFO L246 CegarLoopResult]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-12-07 18:35:56,581 INFO L246 CegarLoopResult]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,581 INFO L246 CegarLoopResult]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,581 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,581 INFO L246 CegarLoopResult]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,582 INFO L246 CegarLoopResult]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,582 INFO L246 CegarLoopResult]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,582 INFO L242 CegarLoopResult]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse34 (+ ~a0~0 61)) (.cse29 (+ ~a4~0 86))) (let ((.cse20 (+ ~a29~0 144)) (.cse10 (<= .cse29 0)) (.cse18 (< 0 .cse34)) (.cse5 (= 3 ~a2~0)) (.cse25 (+ ~a0~0 44)) (.cse24 (<= (* 10 ~a29~0) (+ (* 9 ~a0~0) 806))) (.cse14 (<= ~a29~0 43))) (let ((.cse9 (<= 0 (+ ~a0~0 595421))) (.cse2 (< 0 (+ ~a0~0 147))) (.cse17 (or .cse24 .cse14)) (.cse6 (< 43 ~a29~0)) (.cse22 (<= .cse34 0)) (.cse19 (exists ((v_prenex_1 Int)) (let ((.cse33 (* v_prenex_1 9))) (let ((.cse31 (+ (div .cse33 10) 1))) (let ((.cse32 (mod .cse31 29))) (and (< .cse31 0) (<= .cse32 (+ ~a29~0 15)) (not (= (mod .cse33 10) 0)) (not (= 0 .cse32)) (< (* 9 v_prenex_1) 0))))))) (.cse7 (<= 0 .cse25)) (.cse26 (<= 2 ~a2~0)) (.cse11 (<= (+ ~a0~0 98) 0)) (.cse27 (<= ~a2~0 2)) (.cse1 (<= (+ ~a0~0 99) 0)) (.cse12 (<= (+ ~a29~0 16) 0)) (.cse3 (= 4 ~a2~0)) (.cse23 (let ((.cse30 (not .cse5))) (or (and .cse10 (not (= 2 ~a2~0)) .cse30) (and .cse10 .cse18 .cse30)))) (.cse15 (= 5 ~a2~0)) (.cse28 (exists ((v_~a29~0_895 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_895 299928)) (< 43 v_~a29~0_895) (<= 0 v_~a29~0_895)))) (.cse21 (or .cse10 .cse18)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse8 (<= ~a29~0 41)) (.cse16 (= 1 ~a2~0)) (.cse13 (< 0 .cse20)) (.cse4 (<= 0 (+ ~a0~0 595423)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5) (and .cse0 .cse1 .cse5 .cse6) (and .cse0 .cse7 .cse5 .cse6) (and .cse8 .cse0 .cse1 .cse9 .cse3) (and .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5) (and .cse10 (<= 4696 ~a0~0) .cse14 .cse3) (and .cse11 .cse0 .cse4 .cse15) (and .cse11 .cse0 .cse16 .cse9 .cse6) (and .cse10 .cse17 .cse8 .cse18 .cse3 .cse19) (and .cse11 .cse0 .cse16 .cse2) (and .cse10 .cse17 .cse18 .cse14 .cse3 (<= 0 (+ ~a0~0 54)) .cse19) (and .cse0 .cse1 .cse4 .cse3 .cse6) (and .cse10 .cse16 (<= .cse20 0)) (and .cse21 .cse5 .cse22) (and .cse23 .cse7 .cse15 .cse6) (and .cse10 .cse24 (= .cse25 0) .cse16) (and .cse23 .cse22) (and .cse10 .cse22 .cse19) (and .cse8 .cse0 .cse21 .cse7 .cse5) (and .cse26 .cse23 .cse27 .cse7) (and .cse26 .cse11 .cse0 .cse27 .cse4) (and .cse0 .cse28 .cse1 .cse5) (and .cse10 .cse12 .cse13 .cse3) (and .cse8 .cse23 .cse15) (and .cse0 .cse28 .cse21 .cse5) (and .cse0 .cse8 (< 0 .cse29) .cse16 .cse13 .cse4))))) [2019-12-07 18:35:56,582 INFO L246 CegarLoopResult]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,582 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 18:35:56,582 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 18:35:56,582 INFO L246 CegarLoopResult]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,582 INFO L246 CegarLoopResult]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,582 INFO L246 CegarLoopResult]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,582 INFO L246 CegarLoopResult]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,582 INFO L246 CegarLoopResult]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,582 INFO L246 CegarLoopResult]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,583 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 18:35:56,583 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 18:35:56,583 INFO L246 CegarLoopResult]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,583 INFO L246 CegarLoopResult]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,583 INFO L246 CegarLoopResult]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-12-07 18:35:56,583 INFO L246 CegarLoopResult]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,583 INFO L246 CegarLoopResult]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,583 INFO L246 CegarLoopResult]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,583 INFO L246 CegarLoopResult]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,583 INFO L246 CegarLoopResult]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,583 INFO L246 CegarLoopResult]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,583 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 18:35:56,583 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 18:35:56,583 INFO L246 CegarLoopResult]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,583 INFO L246 CegarLoopResult]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,583 INFO L246 CegarLoopResult]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,583 INFO L246 CegarLoopResult]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,583 INFO L246 CegarLoopResult]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,583 INFO L246 CegarLoopResult]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,583 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 18:35:56,584 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 18:35:56,585 INFO L246 CegarLoopResult]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,585 INFO L246 CegarLoopResult]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,585 INFO L246 CegarLoopResult]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,585 INFO L246 CegarLoopResult]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,585 INFO L246 CegarLoopResult]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,585 INFO L246 CegarLoopResult]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,585 INFO L246 CegarLoopResult]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,585 INFO L246 CegarLoopResult]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-12-07 18:35:56,585 INFO L246 CegarLoopResult]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-12-07 18:35:56,585 INFO L246 CegarLoopResult]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,585 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 18:35:56,585 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 18:35:56,585 INFO L246 CegarLoopResult]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,585 INFO L246 CegarLoopResult]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,585 INFO L246 CegarLoopResult]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,585 INFO L246 CegarLoopResult]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,585 INFO L246 CegarLoopResult]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,585 INFO L246 CegarLoopResult]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,586 INFO L242 CegarLoopResult]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse34 (+ ~a0~0 61)) (.cse29 (+ ~a4~0 86))) (let ((.cse20 (+ ~a29~0 144)) (.cse10 (<= .cse29 0)) (.cse18 (< 0 .cse34)) (.cse5 (= 3 ~a2~0)) (.cse25 (+ ~a0~0 44)) (.cse24 (<= (* 10 ~a29~0) (+ (* 9 ~a0~0) 806))) (.cse14 (<= ~a29~0 43))) (let ((.cse9 (<= 0 (+ ~a0~0 595421))) (.cse2 (< 0 (+ ~a0~0 147))) (.cse17 (or .cse24 .cse14)) (.cse6 (< 43 ~a29~0)) (.cse22 (<= .cse34 0)) (.cse19 (exists ((v_prenex_1 Int)) (let ((.cse33 (* v_prenex_1 9))) (let ((.cse31 (+ (div .cse33 10) 1))) (let ((.cse32 (mod .cse31 29))) (and (< .cse31 0) (<= .cse32 (+ ~a29~0 15)) (not (= (mod .cse33 10) 0)) (not (= 0 .cse32)) (< (* 9 v_prenex_1) 0))))))) (.cse7 (<= 0 .cse25)) (.cse26 (<= 2 ~a2~0)) (.cse11 (<= (+ ~a0~0 98) 0)) (.cse27 (<= ~a2~0 2)) (.cse1 (<= (+ ~a0~0 99) 0)) (.cse12 (<= (+ ~a29~0 16) 0)) (.cse3 (= 4 ~a2~0)) (.cse23 (let ((.cse30 (not .cse5))) (or (and .cse10 (not (= 2 ~a2~0)) .cse30) (and .cse10 .cse18 .cse30)))) (.cse15 (= 5 ~a2~0)) (.cse28 (exists ((v_~a29~0_895 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_895 299928)) (< 43 v_~a29~0_895) (<= 0 v_~a29~0_895)))) (.cse21 (or .cse10 .cse18)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse8 (<= ~a29~0 41)) (.cse16 (= 1 ~a2~0)) (.cse13 (< 0 .cse20)) (.cse4 (<= 0 (+ ~a0~0 595423)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5) (and .cse0 .cse1 .cse5 .cse6) (and .cse0 .cse7 .cse5 .cse6) (and .cse8 .cse0 .cse1 .cse9 .cse3) (and .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5) (and .cse10 (<= 4696 ~a0~0) .cse14 .cse3) (and .cse11 .cse0 .cse4 .cse15) (and .cse11 .cse0 .cse16 .cse9 .cse6) (and .cse10 .cse17 .cse8 .cse18 .cse3 .cse19) (and .cse11 .cse0 .cse16 .cse2) (and .cse10 .cse17 .cse18 .cse14 .cse3 (<= 0 (+ ~a0~0 54)) .cse19) (and .cse0 .cse1 .cse4 .cse3 .cse6) (and .cse10 .cse16 (<= .cse20 0)) (and .cse21 .cse5 .cse22) (and .cse23 .cse7 .cse15 .cse6) (and .cse10 .cse24 (= .cse25 0) .cse16) (and .cse23 .cse22) (and .cse10 .cse22 .cse19) (and .cse8 .cse0 .cse21 .cse7 .cse5) (and .cse26 .cse23 .cse27 .cse7) (and .cse26 .cse11 .cse0 .cse27 .cse4) (and .cse0 .cse28 .cse1 .cse5) (and .cse10 .cse12 .cse13 .cse3) (and .cse8 .cse23 .cse15) (and .cse0 .cse28 .cse21 .cse5) (and .cse0 .cse8 (< 0 .cse29) .cse16 .cse13 .cse4))))) [2019-12-07 18:35:56,586 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 18:35:56,586 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 18:35:56,586 INFO L246 CegarLoopResult]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,586 INFO L246 CegarLoopResult]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,586 INFO L246 CegarLoopResult]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,586 INFO L246 CegarLoopResult]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,586 INFO L246 CegarLoopResult]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,586 INFO L246 CegarLoopResult]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,586 INFO L246 CegarLoopResult]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,586 INFO L246 CegarLoopResult]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,586 INFO L246 CegarLoopResult]: For program point L205(line 205) no Hoare annotation was computed. [2019-12-07 18:35:56,586 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 18:35:56,586 INFO L246 CegarLoopResult]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,586 INFO L246 CegarLoopResult]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 18:35:56,586 INFO L246 CegarLoopResult]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 18:35:56,586 INFO L246 CegarLoopResult]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,586 INFO L246 CegarLoopResult]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,587 INFO L246 CegarLoopResult]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,588 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,589 INFO L246 CegarLoopResult]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,590 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 18:35:56,590 INFO L246 CegarLoopResult]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,590 INFO L246 CegarLoopResult]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,590 INFO L246 CegarLoopResult]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 18:35:56,590 INFO L246 CegarLoopResult]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 18:35:56,590 INFO L246 CegarLoopResult]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,590 INFO L246 CegarLoopResult]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 18:35:56,590 INFO L246 CegarLoopResult]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-12-07 18:35:56,590 INFO L246 CegarLoopResult]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,590 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 18:35:56,590 INFO L246 CegarLoopResult]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,590 INFO L246 CegarLoopResult]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 18:35:56,590 INFO L246 CegarLoopResult]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 18:35:56,590 INFO L246 CegarLoopResult]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,590 INFO L246 CegarLoopResult]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,590 INFO L246 CegarLoopResult]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 18:35:56,590 INFO L246 CegarLoopResult]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 18:35:56,590 INFO L246 CegarLoopResult]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-12-07 18:35:56,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,603 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,603 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:35:56 BoogieIcfgContainer [2019-12-07 18:35:56,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:35:56,637 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:35:56,637 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:35:56,637 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:35:56,638 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:33:55" (3/4) ... [2019-12-07 18:35:56,640 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:35:56,665 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 18:35:56,667 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 18:35:56,687 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 < a0 + 147) && 4 == a2) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 3 == a2)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2) && 43 < a29)) || (((a4 + 42 <= 0 && 0 <= a0 + 44) && 3 == a2) && 43 < a29)) || ((((a29 <= 41 && a4 + 42 <= 0) && a0 + 99 <= 0) && 0 <= a0 + 595421) && 4 == a2)) || (a4 + 86 <= 0 && a0 + 98 <= 0)) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 == a2)) || (((a4 + 86 <= 0 && 4696 <= a0) && a29 <= 43) && 4 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a0 + 595423) && 5 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a0 + 595421) && 43 < a29)) || (((((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && a29 <= 41) && 0 < a0 + 61) && 4 == a2) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || ((((((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && 0 < a0 + 61) && a29 <= 43) && 4 == a2) && 0 <= a0 + 54) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 4 == a2) && 43 < a29)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || (((a4 + 86 <= 0 || 0 < a0 + 61) && 3 == a2) && a0 + 61 <= 0)) || ((((((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2))) && 0 <= a0 + 44) && 5 == a2) && 43 < a29)) || (((a4 + 86 <= 0 && 10 * a29 <= 9 * a0 + 806) && a0 + 44 == 0) && 1 == a2)) || ((((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2))) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || ((((a29 <= 41 && a4 + 42 <= 0) && (a4 + 86 <= 0 || 0 < a0 + 61)) && 0 <= a0 + 44) && 3 == a2)) || (((2 <= a2 && (((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2)))) && a2 <= 2) && 0 <= a0 + 44)) || ((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a2 <= 2) && 0 <= a0 + 595423)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895)) && a0 + 99 <= 0) && 3 == a2)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 4 == a2)) || ((a29 <= 41 && (((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2)))) && 5 == a2)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895)) && (a4 + 86 <= 0 || 0 < a0 + 61)) && 3 == a2)) || (((((a4 + 42 <= 0 && a29 <= 41) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144) && 0 <= a0 + 595423) [2019-12-07 18:35:56,690 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 < a0 + 147) && 4 == a2) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 3 == a2)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2) && 43 < a29)) || (((a4 + 42 <= 0 && 0 <= a0 + 44) && 3 == a2) && 43 < a29)) || ((((a29 <= 41 && a4 + 42 <= 0) && a0 + 99 <= 0) && 0 <= a0 + 595421) && 4 == a2)) || (a4 + 86 <= 0 && a0 + 98 <= 0)) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 == a2)) || (((a4 + 86 <= 0 && 4696 <= a0) && a29 <= 43) && 4 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a0 + 595423) && 5 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a0 + 595421) && 43 < a29)) || (((((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && a29 <= 41) && 0 < a0 + 61) && 4 == a2) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || ((((((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && 0 < a0 + 61) && a29 <= 43) && 4 == a2) && 0 <= a0 + 54) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 4 == a2) && 43 < a29)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || (((a4 + 86 <= 0 || 0 < a0 + 61) && 3 == a2) && a0 + 61 <= 0)) || ((((((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2))) && 0 <= a0 + 44) && 5 == a2) && 43 < a29)) || (((a4 + 86 <= 0 && 10 * a29 <= 9 * a0 + 806) && a0 + 44 == 0) && 1 == a2)) || ((((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2))) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || ((((a29 <= 41 && a4 + 42 <= 0) && (a4 + 86 <= 0 || 0 < a0 + 61)) && 0 <= a0 + 44) && 3 == a2)) || (((2 <= a2 && (((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2)))) && a2 <= 2) && 0 <= a0 + 44)) || ((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a2 <= 2) && 0 <= a0 + 595423)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895)) && a0 + 99 <= 0) && 3 == a2)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 4 == a2)) || ((a29 <= 41 && (((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2)))) && 5 == a2)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895)) && (a4 + 86 <= 0 || 0 < a0 + 61)) && 3 == a2)) || (((((a4 + 42 <= 0 && a29 <= 41) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144) && 0 <= a0 + 595423) [2019-12-07 18:35:56,697 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 < a0 + 147) && 4 == a2) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 3 == a2)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2) && 43 < a29)) || ((((a4 + 86 <= 0 && 10 * a29 <= 9 * a0 + 806) && a0 + 44 == 0) && 1 == a2) && 0 < a29 + 144)) || ((((a29 <= 41 && a4 + 42 <= 0) && a0 + 99 <= 0) && 0 <= a0 + 595421) && 4 == a2)) || (((a4 + 42 <= 0 && 0 <= a0 + 44) && 3 == a2) && 43 < a29)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 < a0 + 147)) || (a4 + 86 <= 0 && a0 + 98 <= 0)) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 == a2)) || (((a4 + 86 <= 0 && 4696 <= a0) && a29 <= 43) && 4 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a0 + 595423) && 5 == a2)) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 4 == a2) && 43 < a29)) || (((a4 + 86 <= 0 || 0 < a0 + 61) && 3 == a2) && a0 + 61 <= 0)) || ((((((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2))) && 0 <= a0 + 44) && 5 == a2) && 43 < a29)) || (((((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && a29 <= 43) && 4 == a2) && 0 <= a0 + 54) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || ((((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2))) && a0 + 61 <= 0)) || ((((a29 <= 41 && a4 + 42 <= 0) && (a4 + 86 <= 0 || 0 < a0 + 61)) && 0 <= a0 + 44) && 3 == a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || ((((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && a29 <= 41) && 4 == a2) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || (((2 <= a2 && (((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2)))) && a2 <= 2) && 0 <= a0 + 44)) || ((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a2 <= 2) && 0 <= a0 + 595423)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895)) && a0 + 99 <= 0) && 3 == a2)) || (((((0 < a4 + 86 || !(1 == input)) && a4 + 42 <= 0) && (\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895)) && (a4 + 86 <= 0 || 0 < a0 + 61)) && 3 == a2)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 4 == a2)) || ((a29 <= 41 && (((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2)))) && 5 == a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 <= a0 + 595421) && 43 < a29)) || (((((a4 + 42 <= 0 && a29 <= 41) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144) && 0 <= a0 + 595423) [2019-12-07 18:35:56,790 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a87728ad-0fab-42c2-a718-58b8c02ccb40/bin/uautomizer/witness.graphml [2019-12-07 18:35:56,790 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:35:56,791 INFO L168 Benchmark]: Toolchain (without parser) took 124443.54 ms. Allocated memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: 3.3 GB). Free memory was 938.2 MB in the beginning and 3.5 GB in the end (delta: -2.6 GB). Peak memory consumption was 707.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:35:56,791 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:35:56,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 704.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.0 MB). Free memory was 938.2 MB in the beginning and 1.0 GB in the end (delta: -68.3 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:35:56,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 968.4 MB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:35:56,792 INFO L168 Benchmark]: Boogie Preprocessor took 134.18 ms. Allocated memory is still 1.1 GB. Free memory was 968.4 MB in the beginning and 945.8 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:35:56,792 INFO L168 Benchmark]: RCFGBuilder took 1867.17 ms. Allocated memory is still 1.1 GB. Free memory was 945.8 MB in the beginning and 883.2 MB in the end (delta: 62.6 MB). Peak memory consumption was 161.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:35:56,792 INFO L168 Benchmark]: TraceAbstraction took 121470.77 ms. Allocated memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: 3.2 GB). Free memory was 878.0 MB in the beginning and 3.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-12-07 18:35:56,792 INFO L168 Benchmark]: Witness Printer took 153.00 ms. Allocated memory is still 4.3 GB. Free memory was 3.6 GB in the beginning and 3.5 GB in the end (delta: 89.3 MB). Peak memory consumption was 89.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:35:56,793 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 704.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.0 MB). Free memory was 938.2 MB in the beginning and 1.0 GB in the end (delta: -68.3 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 110.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 968.4 MB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 134.18 ms. Allocated memory is still 1.1 GB. Free memory was 968.4 MB in the beginning and 945.8 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1867.17 ms. Allocated memory is still 1.1 GB. Free memory was 945.8 MB in the beginning and 883.2 MB in the end (delta: 62.6 MB). Peak memory consumption was 161.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 121470.77 ms. Allocated memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: 3.2 GB). Free memory was 878.0 MB in the beginning and 3.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 153.00 ms. Allocated memory is still 4.3 GB. Free memory was 3.6 GB in the beginning and 3.5 GB in the end (delta: 89.3 MB). Peak memory consumption was 89.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 205]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1766]: Loop Invariant [2019-12-07 18:35:56,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 < a0 + 147) && 4 == a2) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 3 == a2)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2) && 43 < a29)) || (((a4 + 42 <= 0 && 0 <= a0 + 44) && 3 == a2) && 43 < a29)) || ((((a29 <= 41 && a4 + 42 <= 0) && a0 + 99 <= 0) && 0 <= a0 + 595421) && 4 == a2)) || (a4 + 86 <= 0 && a0 + 98 <= 0)) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 == a2)) || (((a4 + 86 <= 0 && 4696 <= a0) && a29 <= 43) && 4 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a0 + 595423) && 5 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a0 + 595421) && 43 < a29)) || (((((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && a29 <= 41) && 0 < a0 + 61) && 4 == a2) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || ((((((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && 0 < a0 + 61) && a29 <= 43) && 4 == a2) && 0 <= a0 + 54) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 4 == a2) && 43 < a29)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || (((a4 + 86 <= 0 || 0 < a0 + 61) && 3 == a2) && a0 + 61 <= 0)) || ((((((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2))) && 0 <= a0 + 44) && 5 == a2) && 43 < a29)) || (((a4 + 86 <= 0 && 10 * a29 <= 9 * a0 + 806) && a0 + 44 == 0) && 1 == a2)) || ((((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2))) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || ((((a29 <= 41 && a4 + 42 <= 0) && (a4 + 86 <= 0 || 0 < a0 + 61)) && 0 <= a0 + 44) && 3 == a2)) || (((2 <= a2 && (((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2)))) && a2 <= 2) && 0 <= a0 + 44)) || ((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a2 <= 2) && 0 <= a0 + 595423)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895)) && a0 + 99 <= 0) && 3 == a2)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 4 == a2)) || ((a29 <= 41 && (((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2)))) && 5 == a2)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895)) && (a4 + 86 <= 0 || 0 < a0 + 61)) && 3 == a2)) || (((((a4 + 42 <= 0 && a29 <= 41) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144) && 0 <= a0 + 595423) - InvariantResult [Line: 23]: Loop Invariant [2019-12-07 18:35:56,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 < a0 + 147) && 4 == a2) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 3 == a2)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2) && 43 < a29)) || (((a4 + 42 <= 0 && 0 <= a0 + 44) && 3 == a2) && 43 < a29)) || ((((a29 <= 41 && a4 + 42 <= 0) && a0 + 99 <= 0) && 0 <= a0 + 595421) && 4 == a2)) || (a4 + 86 <= 0 && a0 + 98 <= 0)) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 == a2)) || (((a4 + 86 <= 0 && 4696 <= a0) && a29 <= 43) && 4 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a0 + 595423) && 5 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a0 + 595421) && 43 < a29)) || (((((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && a29 <= 41) && 0 < a0 + 61) && 4 == a2) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || ((((((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && 0 < a0 + 61) && a29 <= 43) && 4 == a2) && 0 <= a0 + 54) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 4 == a2) && 43 < a29)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || (((a4 + 86 <= 0 || 0 < a0 + 61) && 3 == a2) && a0 + 61 <= 0)) || ((((((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2))) && 0 <= a0 + 44) && 5 == a2) && 43 < a29)) || (((a4 + 86 <= 0 && 10 * a29 <= 9 * a0 + 806) && a0 + 44 == 0) && 1 == a2)) || ((((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2))) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || ((((a29 <= 41 && a4 + 42 <= 0) && (a4 + 86 <= 0 || 0 < a0 + 61)) && 0 <= a0 + 44) && 3 == a2)) || (((2 <= a2 && (((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2)))) && a2 <= 2) && 0 <= a0 + 44)) || ((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a2 <= 2) && 0 <= a0 + 595423)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895)) && a0 + 99 <= 0) && 3 == a2)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 4 == a2)) || ((a29 <= 41 && (((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2)))) && 5 == a2)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895)) && (a4 + 86 <= 0 || 0 < a0 + 61)) && 3 == a2)) || (((((a4 + 42 <= 0 && a29 <= 41) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144) && 0 <= a0 + 595423) - InvariantResult [Line: 1658]: Loop Invariant [2019-12-07 18:35:56,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-12-07 18:35:56,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-12-07 18:35:56,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 < a0 + 147) && 4 == a2) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 3 == a2)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && 3 == a2) && 43 < a29)) || ((((a4 + 86 <= 0 && 10 * a29 <= 9 * a0 + 806) && a0 + 44 == 0) && 1 == a2) && 0 < a29 + 144)) || ((((a29 <= 41 && a4 + 42 <= 0) && a0 + 99 <= 0) && 0 <= a0 + 595421) && 4 == a2)) || (((a4 + 42 <= 0 && 0 <= a0 + 44) && 3 == a2) && 43 < a29)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 < a0 + 147)) || (a4 + 86 <= 0 && a0 + 98 <= 0)) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 == a2)) || (((a4 + 86 <= 0 && 4696 <= a0) && a29 <= 43) && 4 == a2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a0 + 595423) && 5 == a2)) || ((((a4 + 42 <= 0 && a0 + 99 <= 0) && 0 <= a0 + 595423) && 4 == a2) && 43 < a29)) || (((a4 + 86 <= 0 || 0 < a0 + 61) && 3 == a2) && a0 + 61 <= 0)) || ((((((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2))) && 0 <= a0 + 44) && 5 == a2) && 43 < a29)) || (((((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && a29 <= 43) && 4 == a2) && 0 <= a0 + 54) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || ((((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2))) && a0 + 61 <= 0)) || ((((a29 <= 41 && a4 + 42 <= 0) && (a4 + 86 <= 0 || 0 < a0 + 61)) && 0 <= a0 + 44) && 3 == a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || ((((a4 + 86 <= 0 && (10 * a29 <= 9 * a0 + 806 || a29 <= 43)) && a29 <= 41) && 4 == a2) && (\exists v_prenex_1 : int :: (((v_prenex_1 * 9 / 10 + 1 < 0 && (v_prenex_1 * 9 / 10 + 1) % 29 <= a29 + 15) && !(v_prenex_1 * 9 % 10 == 0)) && !(0 == (v_prenex_1 * 9 / 10 + 1) % 29)) && 9 * v_prenex_1 < 0))) || (((2 <= a2 && (((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2)))) && a2 <= 2) && 0 <= a0 + 44)) || ((((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a2 <= 2) && 0 <= a0 + 595423)) || (((a4 + 42 <= 0 && (\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895)) && a0 + 99 <= 0) && 3 == a2)) || (((((0 < a4 + 86 || !(1 == input)) && a4 + 42 <= 0) && (\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895)) && (a4 + 86 <= 0 || 0 < a0 + 61)) && 3 == a2)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && 0 < a29 + 144) && 4 == a2)) || ((a29 <= 41 && (((a4 + 86 <= 0 && !(2 == a2)) && !(3 == a2)) || ((a4 + 86 <= 0 && 0 < a0 + 61) && !(3 == a2)))) && 5 == a2)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 1 == a2) && 0 <= a0 + 595421) && 43 < a29)) || (((((a4 + 42 <= 0 && a29 <= 41) && 0 < a4 + 86) && 1 == a2) && 0 < a29 + 144) && 0 <= a0 + 595423) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 110.8s, OverallIterations: 20, TraceHistogramMax: 12, AutomataDifference: 83.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.4s, HoareTripleCheckerStatistics: 4783 SDtfs, 20713 SDslu, 1331 SDs, 0 SdLazy, 55460 SolverSat, 5615 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 70.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6120 GetRequests, 5962 SyntacticMatches, 19 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1227 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21291occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 30025 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 396 NumberOfFragments, 2474 HoareAnnotationTreeSize, 4 FomulaSimplifications, 83090 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 4 FomulaSimplificationsInter, 140179 FormulaSimplificationTreeSizeReductionInter, 8.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 20821 NumberOfCodeBlocks, 20821 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 20794 ConstructedInterpolants, 129 QuantifiedInterpolants, 68539115 SizeOfPredicates, 12 NumberOfNonLiveVariables, 6893 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 40135/45428 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...