./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/NonTermination4_false-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_774d60a5-75be-460e-93d5-92f956769576/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_774d60a5-75be-460e-93d5-92f956769576/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_774d60a5-75be-460e-93d5-92f956769576/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_774d60a5-75be-460e-93d5-92f956769576/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/termination-crafted/NonTermination4_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_774d60a5-75be-460e-93d5-92f956769576/bin-2019/ukojak/config/svcomp-Overflow-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_774d60a5-75be-460e-93d5-92f956769576/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 94b61e96441ca10668b436b4ef10dfd9464f0863 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 07:36:59,572 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:36:59,573 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:36:59,580 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:36:59,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:36:59,581 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:36:59,582 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:36:59,583 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:36:59,584 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:36:59,585 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:36:59,586 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:36:59,586 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:36:59,587 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:36:59,587 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:36:59,588 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:36:59,588 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:36:59,589 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:36:59,590 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:36:59,591 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:36:59,592 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:36:59,593 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:36:59,593 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:36:59,595 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:36:59,595 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:36:59,596 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:36:59,596 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:36:59,597 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:36:59,597 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:36:59,598 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:36:59,599 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:36:59,599 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:36:59,599 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:36:59,600 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:36:59,600 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:36:59,600 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:36:59,601 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:36:59,601 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_774d60a5-75be-460e-93d5-92f956769576/bin-2019/ukojak/config/svcomp-Overflow-64bit-Kojak_Default.epf [2018-11-23 07:36:59,611 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:36:59,611 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:36:59,612 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:36:59,612 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 07:36:59,613 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:36:59,613 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:36:59,613 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:36:59,613 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 07:36:59,613 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:36:59,614 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:36:59,614 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 07:36:59,614 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:36:59,614 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 07:36:59,614 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 07:36:59,614 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:36:59,614 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:36:59,614 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 07:36:59,615 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 07:36:59,615 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 07:36:59,615 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:36:59,615 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:36:59,615 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 07:36:59,615 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:36:59,615 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:36:59,616 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 07:36:59,616 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 07:36:59,616 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:36:59,616 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 07:36:59,616 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_774d60a5-75be-460e-93d5-92f956769576/bin-2019/ukojak 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94b61e96441ca10668b436b4ef10dfd9464f0863 [2018-11-23 07:36:59,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:36:59,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:36:59,653 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:36:59,654 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:36:59,654 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:36:59,655 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_774d60a5-75be-460e-93d5-92f956769576/bin-2019/ukojak/../../sv-benchmarks/c/termination-crafted/NonTermination4_false-no-overflow.c [2018-11-23 07:36:59,701 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_774d60a5-75be-460e-93d5-92f956769576/bin-2019/ukojak/data/8f9467433/94fd09e2d34640fa80aa5e770039c9a9/FLAG22d54b5b8 [2018-11-23 07:37:00,030 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:37:00,030 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_774d60a5-75be-460e-93d5-92f956769576/sv-benchmarks/c/termination-crafted/NonTermination4_false-no-overflow.c [2018-11-23 07:37:00,035 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_774d60a5-75be-460e-93d5-92f956769576/bin-2019/ukojak/data/8f9467433/94fd09e2d34640fa80aa5e770039c9a9/FLAG22d54b5b8 [2018-11-23 07:37:00,461 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_774d60a5-75be-460e-93d5-92f956769576/bin-2019/ukojak/data/8f9467433/94fd09e2d34640fa80aa5e770039c9a9 [2018-11-23 07:37:00,463 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:37:00,464 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:37:00,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:37:00,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:37:00,467 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:37:00,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:37:00" (1/1) ... [2018-11-23 07:37:00,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@737ce175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:00, skipping insertion in model container [2018-11-23 07:37:00,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:37:00" (1/1) ... [2018-11-23 07:37:00,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:37:00,490 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:37:00,585 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:37:00,588 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:37:00,596 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:37:00,604 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:37:00,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:00 WrapperNode [2018-11-23 07:37:00,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:37:00,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:37:00,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:37:00,605 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:37:00,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:00" (1/1) ... [2018-11-23 07:37:00,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:00" (1/1) ... [2018-11-23 07:37:00,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:37:00,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:37:00,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:37:00,623 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:37:00,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:00" (1/1) ... [2018-11-23 07:37:00,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:00" (1/1) ... [2018-11-23 07:37:00,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:00" (1/1) ... [2018-11-23 07:37:00,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:00" (1/1) ... [2018-11-23 07:37:00,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:00" (1/1) ... [2018-11-23 07:37:00,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:00" (1/1) ... [2018-11-23 07:37:00,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:00" (1/1) ... [2018-11-23 07:37:00,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:37:00,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:37:00,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:37:00,634 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:37:00,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:37:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_774d60a5-75be-460e-93d5-92f956769576/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 07:37:00,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:37:00,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:37:00,798 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:37:00,799 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 07:37:00,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:37:00 BoogieIcfgContainer [2018-11-23 07:37:00,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:37:00,800 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 07:37:00,800 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 07:37:00,806 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 07:37:00,806 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:37:00" (1/1) ... [2018-11-23 07:37:00,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:37:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-11-23 07:37:00,843 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-11-23 07:37:00,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-11-23 07:37:00,845 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:00,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 13 states and 14 transitions. [2018-11-23 07:37:00,965 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 07:37:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 07:37:00,966 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:00,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 16 states and 18 transitions. [2018-11-23 07:37:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 07:37:01,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 07:37:01,060 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:01,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 20 states and 25 transitions. [2018-11-23 07:37:01,254 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2018-11-23 07:37:01,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 07:37:01,254 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:01,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 25 states and 33 transitions. [2018-11-23 07:37:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2018-11-23 07:37:01,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 07:37:01,464 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:01,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 30 states and 42 transitions. [2018-11-23 07:37:01,688 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2018-11-23 07:37:01,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 07:37:01,688 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:01,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 07:37:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 29 states and 41 transitions. [2018-11-23 07:37:01,746 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-11-23 07:37:01,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 07:37:01,747 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:01,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:02,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 34 states and 52 transitions. [2018-11-23 07:37:02,006 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 52 transitions. [2018-11-23 07:37:02,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 07:37:02,007 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:02,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 36 states and 53 transitions. [2018-11-23 07:37:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2018-11-23 07:37:02,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 07:37:02,084 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:02,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 39 states and 56 transitions. [2018-11-23 07:37:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2018-11-23 07:37:02,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 07:37:02,206 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 41 states and 58 transitions. [2018-11-23 07:37:02,328 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2018-11-23 07:37:02,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 07:37:02,329 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:02,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 44 states and 62 transitions. [2018-11-23 07:37:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2018-11-23 07:37:02,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 07:37:02,511 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:02,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 49 states and 73 transitions. [2018-11-23 07:37:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2018-11-23 07:37:02,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 07:37:02,793 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:03,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:03,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 54 states and 86 transitions. [2018-11-23 07:37:03,147 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 86 transitions. [2018-11-23 07:37:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 07:37:03,147 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:03,159 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 57 states and 88 transitions. [2018-11-23 07:37:03,337 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 88 transitions. [2018-11-23 07:37:03,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 07:37:03,338 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:03,348 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:03,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 59 states and 89 transitions. [2018-11-23 07:37:03,440 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2018-11-23 07:37:03,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 07:37:03,441 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:03,450 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:03,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 62 states and 92 transitions. [2018-11-23 07:37:03,664 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 92 transitions. [2018-11-23 07:37:03,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 07:37:03,665 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:04,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 66 states and 98 transitions. [2018-11-23 07:37:04,045 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2018-11-23 07:37:04,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 07:37:04,045 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:04,055 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:04,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 67 states and 98 transitions. [2018-11-23 07:37:04,246 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2018-11-23 07:37:04,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 07:37:04,246 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:04,281 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:04,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:04,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 72 states and 111 transitions. [2018-11-23 07:37:04,651 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 111 transitions. [2018-11-23 07:37:04,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 07:37:04,652 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 77 states and 126 transitions. [2018-11-23 07:37:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 126 transitions. [2018-11-23 07:37:05,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 07:37:05,083 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:05,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 80 states and 128 transitions. [2018-11-23 07:37:05,289 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 128 transitions. [2018-11-23 07:37:05,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 07:37:05,290 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:05,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 83 states and 130 transitions. [2018-11-23 07:37:05,523 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 130 transitions. [2018-11-23 07:37:05,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 07:37:05,524 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:05,534 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:05,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 85 states and 131 transitions. [2018-11-23 07:37:05,671 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 131 transitions. [2018-11-23 07:37:05,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 07:37:05,671 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:05,692 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 88 states and 134 transitions. [2018-11-23 07:37:05,871 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 134 transitions. [2018-11-23 07:37:05,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 07:37:05,871 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:05,913 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:06,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:06,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 96 states and 148 transitions. [2018-11-23 07:37:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 148 transitions. [2018-11-23 07:37:06,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 07:37:06,539 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:06,548 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:06,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 98 states and 149 transitions. [2018-11-23 07:37:06,684 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 149 transitions. [2018-11-23 07:37:06,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 07:37:06,684 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:06,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:06,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 101 states and 152 transitions. [2018-11-23 07:37:06,954 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 152 transitions. [2018-11-23 07:37:06,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 07:37:06,954 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:07,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:07,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 106 states and 167 transitions. [2018-11-23 07:37:07,456 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 167 transitions. [2018-11-23 07:37:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 07:37:07,456 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:07,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:07,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 111 states and 182 transitions. [2018-11-23 07:37:07,956 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 182 transitions. [2018-11-23 07:37:07,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 07:37:07,956 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:07,966 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:08,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 114 states and 184 transitions. [2018-11-23 07:37:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 184 transitions. [2018-11-23 07:37:08,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 07:37:08,094 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:08,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 117 states and 188 transitions. [2018-11-23 07:37:08,360 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 188 transitions. [2018-11-23 07:37:08,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 07:37:08,360 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:08,367 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:08,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 120 states and 190 transitions. [2018-11-23 07:37:08,551 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 190 transitions. [2018-11-23 07:37:08,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 07:37:08,552 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 122 states and 191 transitions. [2018-11-23 07:37:08,713 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 191 transitions. [2018-11-23 07:37:08,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 07:37:08,713 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:09,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:09,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 125 states and 194 transitions. [2018-11-23 07:37:09,006 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 194 transitions. [2018-11-23 07:37:09,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 07:37:09,006 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:09,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 133 states and 209 transitions. [2018-11-23 07:37:09,997 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 209 transitions. [2018-11-23 07:37:09,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 07:37:09,997 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:10,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 134 states and 212 transitions. [2018-11-23 07:37:10,219 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 212 transitions. [2018-11-23 07:37:10,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 07:37:10,220 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:10,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 137 states and 214 transitions. [2018-11-23 07:37:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 214 transitions. [2018-11-23 07:37:10,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 07:37:10,463 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:10,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 139 states and 215 transitions. [2018-11-23 07:37:10,641 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 215 transitions. [2018-11-23 07:37:10,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 07:37:10,641 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:10,649 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:10,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 141 states and 216 transitions. [2018-11-23 07:37:10,838 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2018-11-23 07:37:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 07:37:10,838 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:10,897 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 146 states and 233 transitions. [2018-11-23 07:37:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 233 transitions. [2018-11-23 07:37:11,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 07:37:11,511 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:12,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 151 states and 252 transitions. [2018-11-23 07:37:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 252 transitions. [2018-11-23 07:37:12,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 07:37:12,111 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 154 states and 254 transitions. [2018-11-23 07:37:12,348 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 254 transitions. [2018-11-23 07:37:12,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 07:37:12,348 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 157 states and 256 transitions. [2018-11-23 07:37:12,544 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 256 transitions. [2018-11-23 07:37:12,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 07:37:12,544 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:12,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 160 states and 258 transitions. [2018-11-23 07:37:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 258 transitions. [2018-11-23 07:37:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 07:37:12,740 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:12,750 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:13,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 163 states and 260 transitions. [2018-11-23 07:37:13,080 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 260 transitions. [2018-11-23 07:37:13,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 07:37:13,080 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:13,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 165 states and 261 transitions. [2018-11-23 07:37:13,318 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 261 transitions. [2018-11-23 07:37:13,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 07:37:13,318 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 168 states and 264 transitions. [2018-11-23 07:37:13,653 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 264 transitions. [2018-11-23 07:37:13,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 07:37:13,653 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 176 states and 282 transitions. [2018-11-23 07:37:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 282 transitions. [2018-11-23 07:37:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 07:37:14,816 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:15,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 179 states and 285 transitions. [2018-11-23 07:37:15,168 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 285 transitions. [2018-11-23 07:37:15,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 07:37:15,168 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:15,175 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 181 states and 286 transitions. [2018-11-23 07:37:15,337 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 286 transitions. [2018-11-23 07:37:15,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 07:37:15,337 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 184 states and 288 transitions. [2018-11-23 07:37:15,599 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 288 transitions. [2018-11-23 07:37:15,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 07:37:15,599 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:15,605 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:15,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 187 states and 290 transitions. [2018-11-23 07:37:15,775 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 290 transitions. [2018-11-23 07:37:15,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 07:37:15,775 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 192 states and 309 transitions. [2018-11-23 07:37:16,568 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 309 transitions. [2018-11-23 07:37:16,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 07:37:16,569 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 197 states and 328 transitions. [2018-11-23 07:37:17,236 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 328 transitions. [2018-11-23 07:37:17,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 07:37:17,236 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 200 states and 332 transitions. [2018-11-23 07:37:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 332 transitions. [2018-11-23 07:37:17,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 07:37:17,631 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:17,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 202 states and 333 transitions. [2018-11-23 07:37:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 333 transitions. [2018-11-23 07:37:17,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 07:37:17,825 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:18,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 205 states and 335 transitions. [2018-11-23 07:37:18,034 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 335 transitions. [2018-11-23 07:37:18,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 07:37:18,034 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:18,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 208 states and 337 transitions. [2018-11-23 07:37:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 337 transitions. [2018-11-23 07:37:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 07:37:18,449 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:18,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 211 states and 339 transitions. [2018-11-23 07:37:18,670 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 339 transitions. [2018-11-23 07:37:18,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 07:37:18,671 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:18,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 214 states and 341 transitions. [2018-11-23 07:37:18,997 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 341 transitions. [2018-11-23 07:37:18,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 07:37:18,997 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:19,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:19,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 217 states and 344 transitions. [2018-11-23 07:37:19,452 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 344 transitions. [2018-11-23 07:37:19,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 07:37:19,453 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 225 states and 362 transitions. [2018-11-23 07:37:20,727 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 362 transitions. [2018-11-23 07:37:20,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 07:37:20,727 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:20,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 228 states and 364 transitions. [2018-11-23 07:37:20,974 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 364 transitions. [2018-11-23 07:37:20,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 07:37:20,974 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:20,980 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:21,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 231 states and 366 transitions. [2018-11-23 07:37:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 366 transitions. [2018-11-23 07:37:21,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 07:37:21,310 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:21,315 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:21,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 234 states and 370 transitions. [2018-11-23 07:37:21,732 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 370 transitions. [2018-11-23 07:37:21,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 07:37:21,733 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:22,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:22,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 237 states and 373 transitions. [2018-11-23 07:37:22,153 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 373 transitions. [2018-11-23 07:37:22,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 07:37:22,154 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:22,160 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:22,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 239 states and 374 transitions. [2018-11-23 07:37:22,407 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 374 transitions. [2018-11-23 07:37:22,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 07:37:22,407 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:23,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 244 states and 395 transitions. [2018-11-23 07:37:23,310 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 395 transitions. [2018-11-23 07:37:23,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 07:37:23,310 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:23,402 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 249 states and 416 transitions. [2018-11-23 07:37:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 416 transitions. [2018-11-23 07:37:24,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 07:37:24,308 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:24,314 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:24,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 252 states and 418 transitions. [2018-11-23 07:37:24,525 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 418 transitions. [2018-11-23 07:37:24,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 07:37:24,525 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 255 states and 422 transitions. [2018-11-23 07:37:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 422 transitions. [2018-11-23 07:37:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 07:37:24,925 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 257 states and 423 transitions. [2018-11-23 07:37:25,142 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 423 transitions. [2018-11-23 07:37:25,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 07:37:25,142 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:25,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:25,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 260 states and 425 transitions. [2018-11-23 07:37:25,494 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 425 transitions. [2018-11-23 07:37:25,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 07:37:25,494 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:25,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:25,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 263 states and 427 transitions. [2018-11-23 07:37:25,721 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 427 transitions. [2018-11-23 07:37:25,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 07:37:25,721 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:25,728 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:26,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:26,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 266 states and 430 transitions. [2018-11-23 07:37:26,147 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 430 transitions. [2018-11-23 07:37:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 07:37:26,147 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 269 states and 432 transitions. [2018-11-23 07:37:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 432 transitions. [2018-11-23 07:37:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 07:37:26,380 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:26,386 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:26,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 272 states and 434 transitions. [2018-11-23 07:37:26,721 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 434 transitions. [2018-11-23 07:37:26,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 07:37:26,721 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:28,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 280 states and 456 transitions. [2018-11-23 07:37:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 456 transitions. [2018-11-23 07:37:28,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 07:37:28,616 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:28,621 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:29,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 283 states and 459 transitions. [2018-11-23 07:37:29,113 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 459 transitions. [2018-11-23 07:37:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 07:37:29,113 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:29,118 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:29,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 285 states and 460 transitions. [2018-11-23 07:37:29,346 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 460 transitions. [2018-11-23 07:37:29,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 07:37:29,346 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 288 states and 462 transitions. [2018-11-23 07:37:29,628 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 462 transitions. [2018-11-23 07:37:29,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 07:37:29,628 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:29,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 291 states and 464 transitions. [2018-11-23 07:37:29,869 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 464 transitions. [2018-11-23 07:37:29,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 07:37:29,869 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:29,875 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:30,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 294 states and 466 transitions. [2018-11-23 07:37:30,239 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 466 transitions. [2018-11-23 07:37:30,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 07:37:30,239 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:30,244 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 297 states and 468 transitions. [2018-11-23 07:37:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 468 transitions. [2018-11-23 07:37:30,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 07:37:30,486 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:31,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 302 states and 491 transitions. [2018-11-23 07:37:31,572 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 491 transitions. [2018-11-23 07:37:31,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 07:37:31,573 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:31,676 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 307 states and 514 transitions. [2018-11-23 07:37:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 514 transitions. [2018-11-23 07:37:32,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 07:37:32,486 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 310 states and 516 transitions. [2018-11-23 07:37:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 516 transitions. [2018-11-23 07:37:32,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 07:37:32,754 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:33,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 313 states and 518 transitions. [2018-11-23 07:37:33,014 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 518 transitions. [2018-11-23 07:37:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 07:37:33,015 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:33,022 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 316 states and 520 transitions. [2018-11-23 07:37:33,297 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 520 transitions. [2018-11-23 07:37:33,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 07:37:33,298 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:33,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 319 states and 524 transitions. [2018-11-23 07:37:33,790 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 524 transitions. [2018-11-23 07:37:33,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 07:37:33,791 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:34,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 322 states and 526 transitions. [2018-11-23 07:37:34,056 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 526 transitions. [2018-11-23 07:37:34,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 07:37:34,056 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:34,062 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:34,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 324 states and 527 transitions. [2018-11-23 07:37:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 527 transitions. [2018-11-23 07:37:34,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 07:37:34,311 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:34,317 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 327 states and 530 transitions. [2018-11-23 07:37:34,799 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 530 transitions. [2018-11-23 07:37:34,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 07:37:34,799 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:35,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:35,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 330 states and 532 transitions. [2018-11-23 07:37:35,213 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 532 transitions. [2018-11-23 07:37:35,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 07:37:35,213 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:35,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 333 states and 534 transitions. [2018-11-23 07:37:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 534 transitions. [2018-11-23 07:37:35,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 07:37:35,817 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:35,932 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:37,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 341 states and 556 transitions. [2018-11-23 07:37:37,495 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 556 transitions. [2018-11-23 07:37:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 07:37:37,495 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:37,501 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 344 states and 558 transitions. [2018-11-23 07:37:37,773 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 558 transitions. [2018-11-23 07:37:37,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 07:37:37,773 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:38,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 347 states and 560 transitions. [2018-11-23 07:37:38,064 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 560 transitions. [2018-11-23 07:37:38,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 07:37:38,065 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:38,070 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 350 states and 564 transitions. [2018-11-23 07:37:38,641 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 564 transitions. [2018-11-23 07:37:38,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 07:37:38,641 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 353 states and 567 transitions. [2018-11-23 07:37:39,194 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 567 transitions. [2018-11-23 07:37:39,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 07:37:39,194 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:39,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 355 states and 568 transitions. [2018-11-23 07:37:39,472 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 568 transitions. [2018-11-23 07:37:39,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 07:37:39,472 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:39,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 358 states and 570 transitions. [2018-11-23 07:37:39,769 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 570 transitions. [2018-11-23 07:37:39,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 07:37:39,769 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:40,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 361 states and 572 transitions. [2018-11-23 07:37:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 572 transitions. [2018-11-23 07:37:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 07:37:40,223 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:41,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 366 states and 597 transitions. [2018-11-23 07:37:41,504 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 597 transitions. [2018-11-23 07:37:41,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 07:37:41,505 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:42,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 371 states and 622 transitions. [2018-11-23 07:37:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 622 transitions. [2018-11-23 07:37:42,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 07:37:42,574 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:42,583 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:42,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:42,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 374 states and 624 transitions. [2018-11-23 07:37:42,882 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 624 transitions. [2018-11-23 07:37:42,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 07:37:42,883 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:42,890 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:43,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 377 states and 626 transitions. [2018-11-23 07:37:43,544 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 626 transitions. [2018-11-23 07:37:43,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 07:37:43,544 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:43,553 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 380 states and 628 transitions. [2018-11-23 07:37:43,850 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 628 transitions. [2018-11-23 07:37:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 07:37:43,850 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:43,858 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:44,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 383 states and 632 transitions. [2018-11-23 07:37:44,420 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 632 transitions. [2018-11-23 07:37:44,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 07:37:44,420 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:44,428 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:44,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 386 states and 634 transitions. [2018-11-23 07:37:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 634 transitions. [2018-11-23 07:37:44,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 07:37:44,928 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:45,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:45,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 389 states and 636 transitions. [2018-11-23 07:37:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 636 transitions. [2018-11-23 07:37:45,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 07:37:45,280 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:45,287 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:45,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 392 states and 638 transitions. [2018-11-23 07:37:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 638 transitions. [2018-11-23 07:37:45,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 07:37:45,588 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 395 states and 640 transitions. [2018-11-23 07:37:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 640 transitions. [2018-11-23 07:37:45,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 07:37:45,888 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:46,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:46,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 397 states and 641 transitions. [2018-11-23 07:37:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 641 transitions. [2018-11-23 07:37:46,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 07:37:46,190 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:46,197 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:46,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 400 states and 644 transitions. [2018-11-23 07:37:46,771 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 644 transitions. [2018-11-23 07:37:46,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 07:37:46,771 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 408 states and 668 transitions. [2018-11-23 07:37:48,819 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 668 transitions. [2018-11-23 07:37:48,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 07:37:48,820 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:48,825 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:49,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:49,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 411 states and 672 transitions. [2018-11-23 07:37:49,461 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 672 transitions. [2018-11-23 07:37:49,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 07:37:49,461 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:49,467 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:49,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:49,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 414 states and 674 transitions. [2018-11-23 07:37:49,954 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 674 transitions. [2018-11-23 07:37:49,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 07:37:49,955 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 417 states and 676 transitions. [2018-11-23 07:37:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 676 transitions. [2018-11-23 07:37:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 07:37:50,314 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:50,319 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:50,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 420 states and 678 transitions. [2018-11-23 07:37:50,660 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 678 transitions. [2018-11-23 07:37:50,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 07:37:50,660 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:50,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 423 states and 680 transitions. [2018-11-23 07:37:50,995 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 680 transitions. [2018-11-23 07:37:50,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 07:37:50,995 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:51,004 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:51,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 425 states and 681 transitions. [2018-11-23 07:37:51,328 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 681 transitions. [2018-11-23 07:37:51,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 07:37:51,328 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:51,333 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:51,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 428 states and 684 transitions. [2018-11-23 07:37:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 684 transitions. [2018-11-23 07:37:51,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 07:37:51,957 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 431 states and 686 transitions. [2018-11-23 07:37:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 686 transitions. [2018-11-23 07:37:52,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 07:37:52,288 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:52,431 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:53,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:53,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 436 states and 713 transitions. [2018-11-23 07:37:53,878 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 713 transitions. [2018-11-23 07:37:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 07:37:53,878 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:55,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:55,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 441 states and 740 transitions. [2018-11-23 07:37:55,080 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 740 transitions. [2018-11-23 07:37:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 07:37:55,080 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:55,086 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 444 states and 742 transitions. [2018-11-23 07:37:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 742 transitions. [2018-11-23 07:37:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 07:37:55,606 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:55,613 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:56,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 447 states and 746 transitions. [2018-11-23 07:37:56,252 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 746 transitions. [2018-11-23 07:37:56,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 07:37:56,252 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 450 states and 748 transitions. [2018-11-23 07:37:56,684 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 748 transitions. [2018-11-23 07:37:56,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 07:37:56,684 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:57,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 453 states and 750 transitions. [2018-11-23 07:37:57,021 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 750 transitions. [2018-11-23 07:37:57,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 07:37:57,021 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:57,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 456 states and 752 transitions. [2018-11-23 07:37:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 752 transitions. [2018-11-23 07:37:57,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 07:37:57,874 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:58,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 459 states and 754 transitions. [2018-11-23 07:37:58,278 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 754 transitions. [2018-11-23 07:37:58,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 07:37:58,278 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 461 states and 755 transitions. [2018-11-23 07:37:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 755 transitions. [2018-11-23 07:37:58,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 07:37:58,636 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:59,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 464 states and 758 transitions. [2018-11-23 07:37:59,305 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 758 transitions. [2018-11-23 07:37:59,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 07:37:59,306 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:59,311 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:37:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:37:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 467 states and 760 transitions. [2018-11-23 07:37:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 760 transitions. [2018-11-23 07:37:59,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 07:37:59,684 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:37:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:37:59,693 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 470 states and 762 transitions. [2018-11-23 07:38:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 762 transitions. [2018-11-23 07:38:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 07:38:00,125 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:00,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 473 states and 764 transitions. [2018-11-23 07:38:00,532 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 764 transitions. [2018-11-23 07:38:00,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 07:38:00,532 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:00,716 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 481 states and 790 transitions. [2018-11-23 07:38:02,963 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 790 transitions. [2018-11-23 07:38:02,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 07:38:02,963 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 484 states and 792 transitions. [2018-11-23 07:38:03,333 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 792 transitions. [2018-11-23 07:38:03,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 07:38:03,333 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:03,339 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:03,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:03,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 487 states and 794 transitions. [2018-11-23 07:38:03,729 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 794 transitions. [2018-11-23 07:38:03,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 07:38:03,729 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:04,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:04,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 490 states and 796 transitions. [2018-11-23 07:38:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 796 transitions. [2018-11-23 07:38:04,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 07:38:04,154 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:04,162 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:04,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 493 states and 798 transitions. [2018-11-23 07:38:04,532 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 798 transitions. [2018-11-23 07:38:04,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 07:38:04,533 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 496 states and 800 transitions. [2018-11-23 07:38:04,968 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 800 transitions. [2018-11-23 07:38:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 07:38:04,968 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 499 states and 802 transitions. [2018-11-23 07:38:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 802 transitions. [2018-11-23 07:38:05,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 07:38:05,630 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:06,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 502 states and 806 transitions. [2018-11-23 07:38:06,357 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 806 transitions. [2018-11-23 07:38:06,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 07:38:06,357 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 505 states and 809 transitions. [2018-11-23 07:38:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 809 transitions. [2018-11-23 07:38:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 07:38:07,193 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:07,199 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:07,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:07,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 507 states and 810 transitions. [2018-11-23 07:38:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 810 transitions. [2018-11-23 07:38:07,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 07:38:07,579 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:07,730 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 512 states and 839 transitions. [2018-11-23 07:38:09,324 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 839 transitions. [2018-11-23 07:38:09,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 07:38:09,324 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 517 states and 868 transitions. [2018-11-23 07:38:10,805 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 868 transitions. [2018-11-23 07:38:10,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 07:38:10,805 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:11,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 520 states and 870 transitions. [2018-11-23 07:38:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 870 transitions. [2018-11-23 07:38:11,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 07:38:11,216 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 523 states and 872 transitions. [2018-11-23 07:38:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 872 transitions. [2018-11-23 07:38:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 07:38:11,618 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:11,625 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 526 states and 874 transitions. [2018-11-23 07:38:12,027 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 874 transitions. [2018-11-23 07:38:12,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 07:38:12,027 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 529 states and 876 transitions. [2018-11-23 07:38:12,644 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 876 transitions. [2018-11-23 07:38:12,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 07:38:12,644 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:13,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:13,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 532 states and 878 transitions. [2018-11-23 07:38:13,063 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 878 transitions. [2018-11-23 07:38:13,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 07:38:13,063 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 535 states and 880 transitions. [2018-11-23 07:38:13,932 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 880 transitions. [2018-11-23 07:38:13,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 07:38:13,932 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:14,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:14,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 538 states and 882 transitions. [2018-11-23 07:38:14,341 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 882 transitions. [2018-11-23 07:38:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 07:38:14,341 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:14,348 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:15,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 541 states and 886 transitions. [2018-11-23 07:38:15,186 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 886 transitions. [2018-11-23 07:38:15,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 07:38:15,186 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:15,192 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:15,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 543 states and 887 transitions. [2018-11-23 07:38:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 887 transitions. [2018-11-23 07:38:15,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 07:38:15,579 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:16,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 546 states and 890 transitions. [2018-11-23 07:38:16,328 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 890 transitions. [2018-11-23 07:38:16,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 07:38:16,328 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:16,338 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:16,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:16,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 549 states and 892 transitions. [2018-11-23 07:38:16,797 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 892 transitions. [2018-11-23 07:38:16,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 07:38:16,797 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 552 states and 894 transitions. [2018-11-23 07:38:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 894 transitions. [2018-11-23 07:38:17,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 07:38:17,209 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:17,394 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:19,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 560 states and 922 transitions. [2018-11-23 07:38:19,872 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 922 transitions. [2018-11-23 07:38:19,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 07:38:19,873 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:20,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 563 states and 924 transitions. [2018-11-23 07:38:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 924 transitions. [2018-11-23 07:38:20,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 07:38:20,407 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:21,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 566 states and 926 transitions. [2018-11-23 07:38:21,067 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 926 transitions. [2018-11-23 07:38:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 07:38:21,068 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:21,074 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 569 states and 928 transitions. [2018-11-23 07:38:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 928 transitions. [2018-11-23 07:38:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 07:38:21,498 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 572 states and 930 transitions. [2018-11-23 07:38:21,936 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 930 transitions. [2018-11-23 07:38:21,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 07:38:21,936 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:22,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 575 states and 934 transitions. [2018-11-23 07:38:22,760 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 934 transitions. [2018-11-23 07:38:22,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 07:38:22,760 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:22,767 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:23,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 577 states and 935 transitions. [2018-11-23 07:38:23,191 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 935 transitions. [2018-11-23 07:38:23,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 07:38:23,191 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:23,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:23,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 580 states and 937 transitions. [2018-11-23 07:38:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 937 transitions. [2018-11-23 07:38:23,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 07:38:23,713 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:24,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:24,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 583 states and 939 transitions. [2018-11-23 07:38:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 939 transitions. [2018-11-23 07:38:24,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 07:38:24,147 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:24,156 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 586 states and 941 transitions. [2018-11-23 07:38:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 941 transitions. [2018-11-23 07:38:24,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 07:38:24,604 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:25,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:25,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 589 states and 944 transitions. [2018-11-23 07:38:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 944 transitions. [2018-11-23 07:38:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 07:38:25,537 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:25,710 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:27,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 594 states and 975 transitions. [2018-11-23 07:38:27,535 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 975 transitions. [2018-11-23 07:38:27,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 07:38:27,536 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:29,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 599 states and 1006 transitions. [2018-11-23 07:38:29,118 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1006 transitions. [2018-11-23 07:38:29,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 07:38:29,118 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:30,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 602 states and 1008 transitions. [2018-11-23 07:38:30,090 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1008 transitions. [2018-11-23 07:38:30,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 07:38:30,090 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:30,100 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:30,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:30,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 605 states and 1010 transitions. [2018-11-23 07:38:30,564 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1010 transitions. [2018-11-23 07:38:30,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 07:38:30,564 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:31,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:31,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 608 states and 1012 transitions. [2018-11-23 07:38:31,107 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1012 transitions. [2018-11-23 07:38:31,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 07:38:31,107 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:31,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:31,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 611 states and 1014 transitions. [2018-11-23 07:38:31,561 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1014 transitions. [2018-11-23 07:38:31,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 07:38:31,561 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 614 states and 1016 transitions. [2018-11-23 07:38:32,021 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1016 transitions. [2018-11-23 07:38:32,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 07:38:32,021 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 617 states and 1018 transitions. [2018-11-23 07:38:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1018 transitions. [2018-11-23 07:38:32,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 07:38:32,483 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 620 states and 1020 transitions. [2018-11-23 07:38:32,937 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1020 transitions. [2018-11-23 07:38:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 07:38:32,937 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:32,945 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:33,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 623 states and 1022 transitions. [2018-11-23 07:38:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1022 transitions. [2018-11-23 07:38:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 07:38:33,656 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 626 states and 1024 transitions. [2018-11-23 07:38:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1024 transitions. [2018-11-23 07:38:34,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 07:38:34,117 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:34,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:34,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 629 states and 1028 transitions. [2018-11-23 07:38:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1028 transitions. [2018-11-23 07:38:34,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 07:38:34,995 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:35,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 631 states and 1029 transitions. [2018-11-23 07:38:35,449 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1029 transitions. [2018-11-23 07:38:35,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 07:38:35,449 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 634 states and 1032 transitions. [2018-11-23 07:38:36,407 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1032 transitions. [2018-11-23 07:38:36,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 07:38:36,408 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 637 states and 1034 transitions. [2018-11-23 07:38:36,875 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1034 transitions. [2018-11-23 07:38:36,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 07:38:36,875 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:39,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:39,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 642 states and 1062 transitions. [2018-11-23 07:38:39,456 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1062 transitions. [2018-11-23 07:38:39,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 07:38:39,457 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:39,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 645 states and 1064 transitions. [2018-11-23 07:38:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1064 transitions. [2018-11-23 07:38:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 07:38:39,935 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:39,941 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 648 states and 1066 transitions. [2018-11-23 07:38:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1066 transitions. [2018-11-23 07:38:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 07:38:40,434 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:41,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 651 states and 1070 transitions. [2018-11-23 07:38:41,394 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1070 transitions. [2018-11-23 07:38:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 07:38:41,394 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:41,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 654 states and 1072 transitions. [2018-11-23 07:38:41,885 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1072 transitions. [2018-11-23 07:38:41,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 07:38:41,885 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:41,896 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:42,479 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-23 07:38:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 657 states and 1074 transitions. [2018-11-23 07:38:42,491 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1074 transitions. [2018-11-23 07:38:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 07:38:42,491 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:43,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 660 states and 1076 transitions. [2018-11-23 07:38:43,240 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1076 transitions. [2018-11-23 07:38:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 07:38:43,241 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:43,247 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:43,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 663 states and 1078 transitions. [2018-11-23 07:38:43,751 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1078 transitions. [2018-11-23 07:38:43,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 07:38:43,751 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 666 states and 1080 transitions. [2018-11-23 07:38:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1080 transitions. [2018-11-23 07:38:44,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 07:38:44,258 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:44,264 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 668 states and 1081 transitions. [2018-11-23 07:38:44,750 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1081 transitions. [2018-11-23 07:38:44,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 07:38:44,750 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:44,758 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:45,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 671 states and 1084 transitions. [2018-11-23 07:38:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 1084 transitions. [2018-11-23 07:38:45,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 07:38:45,701 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:46,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 674 states and 1086 transitions. [2018-11-23 07:38:46,205 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1086 transitions. [2018-11-23 07:38:46,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 07:38:46,205 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:46,213 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 677 states and 1088 transitions. [2018-11-23 07:38:46,721 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1088 transitions. [2018-11-23 07:38:46,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 07:38:46,722 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:49,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 682 states and 1121 transitions. [2018-11-23 07:38:49,112 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1121 transitions. [2018-11-23 07:38:49,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 07:38:49,112 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:49,338 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:50,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 687 states and 1154 transitions. [2018-11-23 07:38:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1154 transitions. [2018-11-23 07:38:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 07:38:50,951 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 690 states and 1156 transitions. [2018-11-23 07:38:51,456 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1156 transitions. [2018-11-23 07:38:51,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 07:38:51,457 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:51,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 693 states and 1158 transitions. [2018-11-23 07:38:51,967 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1158 transitions. [2018-11-23 07:38:51,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 07:38:51,968 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:52,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 696 states and 1160 transitions. [2018-11-23 07:38:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1160 transitions. [2018-11-23 07:38:52,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 07:38:52,499 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:53,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:53,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 699 states and 1162 transitions. [2018-11-23 07:38:53,006 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1162 transitions. [2018-11-23 07:38:53,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 07:38:53,007 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:54,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 702 states and 1166 transitions. [2018-11-23 07:38:54,001 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1166 transitions. [2018-11-23 07:38:54,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 07:38:54,002 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 705 states and 1168 transitions. [2018-11-23 07:38:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1168 transitions. [2018-11-23 07:38:54,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 07:38:54,579 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:54,586 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 707 states and 1169 transitions. [2018-11-23 07:38:55,206 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1169 transitions. [2018-11-23 07:38:55,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 07:38:55,206 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:56,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 710 states and 1172 transitions. [2018-11-23 07:38:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1172 transitions. [2018-11-23 07:38:56,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 07:38:56,161 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:56,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 713 states and 1174 transitions. [2018-11-23 07:38:56,695 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1174 transitions. [2018-11-23 07:38:56,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 07:38:56,696 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 716 states and 1176 transitions. [2018-11-23 07:38:57,211 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1176 transitions. [2018-11-23 07:38:57,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 07:38:57,211 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:57,218 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 719 states and 1178 transitions. [2018-11-23 07:38:57,744 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1178 transitions. [2018-11-23 07:38:57,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 07:38:57,745 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:57,751 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:58,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 722 states and 1180 transitions. [2018-11-23 07:38:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1180 transitions. [2018-11-23 07:38:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 07:38:58,257 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:38:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:38:59,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 725 states and 1182 transitions. [2018-11-23 07:38:59,063 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1182 transitions. [2018-11-23 07:38:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 07:38:59,064 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:38:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:38:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:00,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 728 states and 1184 transitions. [2018-11-23 07:39:00,218 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1184 transitions. [2018-11-23 07:39:00,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 07:39:00,218 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:00,481 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 736 states and 1216 transitions. [2018-11-23 07:39:03,985 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1216 transitions. [2018-11-23 07:39:03,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 07:39:03,985 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:03,992 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:04,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:04,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 739 states and 1218 transitions. [2018-11-23 07:39:04,579 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1218 transitions. [2018-11-23 07:39:04,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 07:39:04,579 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:05,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:05,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 742 states and 1220 transitions. [2018-11-23 07:39:05,182 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1220 transitions. [2018-11-23 07:39:05,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 07:39:05,183 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:06,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 745 states and 1224 transitions. [2018-11-23 07:39:06,282 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1224 transitions. [2018-11-23 07:39:06,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 07:39:06,282 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 748 states and 1226 transitions. [2018-11-23 07:39:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1226 transitions. [2018-11-23 07:39:07,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 07:39:07,134 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:07,141 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:07,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:07,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 751 states and 1228 transitions. [2018-11-23 07:39:07,683 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1228 transitions. [2018-11-23 07:39:07,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 07:39:07,684 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:08,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 754 states and 1230 transitions. [2018-11-23 07:39:08,248 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1230 transitions. [2018-11-23 07:39:08,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 07:39:08,249 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:08,257 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:08,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 757 states and 1232 transitions. [2018-11-23 07:39:08,829 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1232 transitions. [2018-11-23 07:39:08,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 07:39:08,829 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:08,837 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:09,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 760 states and 1234 transitions. [2018-11-23 07:39:09,551 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1234 transitions. [2018-11-23 07:39:09,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 07:39:09,551 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 763 states and 1236 transitions. [2018-11-23 07:39:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1236 transitions. [2018-11-23 07:39:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 07:39:10,183 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:10,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 766 states and 1238 transitions. [2018-11-23 07:39:10,814 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1238 transitions. [2018-11-23 07:39:10,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 07:39:10,815 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 768 states and 1239 transitions. [2018-11-23 07:39:11,453 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1239 transitions. [2018-11-23 07:39:11,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 07:39:11,453 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:12,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:12,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 771 states and 1242 transitions. [2018-11-23 07:39:12,600 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1242 transitions. [2018-11-23 07:39:12,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 07:39:12,600 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:12,823 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:15,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 776 states and 1277 transitions. [2018-11-23 07:39:15,233 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1277 transitions. [2018-11-23 07:39:15,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 07:39:15,234 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:17,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 781 states and 1312 transitions. [2018-11-23 07:39:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1312 transitions. [2018-11-23 07:39:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 07:39:17,498 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:18,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:18,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 784 states and 1314 transitions. [2018-11-23 07:39:18,074 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1314 transitions. [2018-11-23 07:39:18,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 07:39:18,074 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:18,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:18,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 787 states and 1316 transitions. [2018-11-23 07:39:18,963 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1316 transitions. [2018-11-23 07:39:18,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 07:39:18,964 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:18,971 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:20,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 790 states and 1318 transitions. [2018-11-23 07:39:20,219 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1318 transitions. [2018-11-23 07:39:20,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 07:39:20,220 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:20,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:20,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 793 states and 1320 transitions. [2018-11-23 07:39:20,888 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1320 transitions. [2018-11-23 07:39:20,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 07:39:20,889 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:21,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 796 states and 1322 transitions. [2018-11-23 07:39:21,466 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1322 transitions. [2018-11-23 07:39:21,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 07:39:21,467 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:21,475 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 799 states and 1326 transitions. [2018-11-23 07:39:22,610 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1326 transitions. [2018-11-23 07:39:22,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 07:39:22,610 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 801 states and 1327 transitions. [2018-11-23 07:39:23,193 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1327 transitions. [2018-11-23 07:39:23,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 07:39:23,194 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 804 states and 1329 transitions. [2018-11-23 07:39:23,816 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1329 transitions. [2018-11-23 07:39:23,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 07:39:23,817 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:23,824 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 807 states and 1331 transitions. [2018-11-23 07:39:24,421 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1331 transitions. [2018-11-23 07:39:24,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 07:39:24,421 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:24,434 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 810 states and 1333 transitions. [2018-11-23 07:39:25,153 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1333 transitions. [2018-11-23 07:39:25,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 07:39:25,154 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:25,161 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 813 states and 1336 transitions. [2018-11-23 07:39:26,239 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1336 transitions. [2018-11-23 07:39:26,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 07:39:26,239 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:26,247 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:26,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 816 states and 1338 transitions. [2018-11-23 07:39:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1338 transitions. [2018-11-23 07:39:26,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 07:39:26,842 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:26,849 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:27,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 819 states and 1340 transitions. [2018-11-23 07:39:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1340 transitions. [2018-11-23 07:39:27,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 07:39:27,433 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:28,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 822 states and 1342 transitions. [2018-11-23 07:39:28,105 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1342 transitions. [2018-11-23 07:39:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 07:39:28,106 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:28,113 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:28,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 825 states and 1344 transitions. [2018-11-23 07:39:28,715 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1344 transitions. [2018-11-23 07:39:28,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 07:39:28,716 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 525 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:32,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 833 states and 1378 transitions. [2018-11-23 07:39:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1378 transitions. [2018-11-23 07:39:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 07:39:32,871 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 525 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:33,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:33,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 836 states and 1380 transitions. [2018-11-23 07:39:33,512 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1380 transitions. [2018-11-23 07:39:33,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 07:39:33,512 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:33,521 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 525 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:34,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 839 states and 1382 transitions. [2018-11-23 07:39:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1382 transitions. [2018-11-23 07:39:34,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 07:39:34,134 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:34,142 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 525 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 842 states and 1386 transitions. [2018-11-23 07:39:35,346 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1386 transitions. [2018-11-23 07:39:35,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 07:39:35,346 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 525 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:36,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 845 states and 1388 transitions. [2018-11-23 07:39:36,306 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1388 transitions. [2018-11-23 07:39:36,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 07:39:36,306 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 525 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:37,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 848 states and 1391 transitions. [2018-11-23 07:39:37,507 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1391 transitions. [2018-11-23 07:39:37,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 07:39:37,508 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:37,515 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 525 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:38,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 850 states and 1392 transitions. [2018-11-23 07:39:38,125 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1392 transitions. [2018-11-23 07:39:38,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 07:39:38,126 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 525 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:38,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 853 states and 1394 transitions. [2018-11-23 07:39:38,778 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1394 transitions. [2018-11-23 07:39:38,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 07:39:38,779 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:38,787 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 525 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:39,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 856 states and 1396 transitions. [2018-11-23 07:39:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1396 transitions. [2018-11-23 07:39:39,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 07:39:39,425 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:39,436 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 525 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:40,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 859 states and 1398 transitions. [2018-11-23 07:39:40,077 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1398 transitions. [2018-11-23 07:39:40,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 07:39:40,077 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 525 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:40,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 862 states and 1400 transitions. [2018-11-23 07:39:40,731 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1400 transitions. [2018-11-23 07:39:40,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 07:39:40,731 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 525 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 865 states and 1402 transitions. [2018-11-23 07:39:41,513 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1402 transitions. [2018-11-23 07:39:41,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 07:39:41,514 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 525 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:42,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 868 states and 1404 transitions. [2018-11-23 07:39:42,207 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1404 transitions. [2018-11-23 07:39:42,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 07:39:42,207 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 525 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 871 states and 1406 transitions. [2018-11-23 07:39:42,873 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1406 transitions. [2018-11-23 07:39:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 07:39:42,873 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:45,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:45,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 876 states and 1443 transitions. [2018-11-23 07:39:45,809 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1443 transitions. [2018-11-23 07:39:45,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 07:39:45,809 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 881 states and 1480 transitions. [2018-11-23 07:39:48,164 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1480 transitions. [2018-11-23 07:39:48,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 07:39:48,165 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:48,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:48,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 884 states and 1482 transitions. [2018-11-23 07:39:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1482 transitions. [2018-11-23 07:39:48,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 07:39:48,814 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:48,822 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:49,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 887 states and 1484 transitions. [2018-11-23 07:39:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1484 transitions. [2018-11-23 07:39:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 07:39:49,483 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:49,664 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 890 states and 1486 transitions. [2018-11-23 07:39:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1486 transitions. [2018-11-23 07:39:50,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 07:39:50,307 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:50,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 893 states and 1488 transitions. [2018-11-23 07:39:50,963 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1488 transitions. [2018-11-23 07:39:50,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 07:39:50,964 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:50,971 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 896 states and 1490 transitions. [2018-11-23 07:39:51,603 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1490 transitions. [2018-11-23 07:39:51,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 07:39:51,603 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:52,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 899 states and 1492 transitions. [2018-11-23 07:39:52,266 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1492 transitions. [2018-11-23 07:39:52,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 07:39:52,266 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:52,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 902 states and 1494 transitions. [2018-11-23 07:39:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1494 transitions. [2018-11-23 07:39:52,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 07:39:52,938 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 905 states and 1496 transitions. [2018-11-23 07:39:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1496 transitions. [2018-11-23 07:39:53,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 07:39:53,953 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 908 states and 1498 transitions. [2018-11-23 07:39:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1498 transitions. [2018-11-23 07:39:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 07:39:54,617 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:54,624 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:55,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:55,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 911 states and 1500 transitions. [2018-11-23 07:39:55,294 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1500 transitions. [2018-11-23 07:39:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 07:39:55,295 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:55,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 914 states and 1502 transitions. [2018-11-23 07:39:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1502 transitions. [2018-11-23 07:39:55,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 07:39:55,959 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 917 states and 1504 transitions. [2018-11-23 07:39:57,401 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1504 transitions. [2018-11-23 07:39:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 07:39:57,401 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:58,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 920 states and 1506 transitions. [2018-11-23 07:39:58,038 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1506 transitions. [2018-11-23 07:39:58,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 07:39:58,038 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:39:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:39:59,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 923 states and 1510 transitions. [2018-11-23 07:39:59,460 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1510 transitions. [2018-11-23 07:39:59,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 07:39:59,461 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:39:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:39:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:00,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 925 states and 1511 transitions. [2018-11-23 07:40:00,104 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1511 transitions. [2018-11-23 07:40:00,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 07:40:00,105 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:00,112 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:01,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:01,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 928 states and 1514 transitions. [2018-11-23 07:40:01,353 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1514 transitions. [2018-11-23 07:40:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 07:40:01,354 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:05,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 936 states and 1550 transitions. [2018-11-23 07:40:05,815 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1550 transitions. [2018-11-23 07:40:05,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 07:40:05,816 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:06,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:06,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 939 states and 1552 transitions. [2018-11-23 07:40:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1552 transitions. [2018-11-23 07:40:06,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 07:40:06,506 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:06,515 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:07,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 942 states and 1554 transitions. [2018-11-23 07:40:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1554 transitions. [2018-11-23 07:40:07,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 07:40:07,200 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:07,208 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:08,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:08,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 945 states and 1556 transitions. [2018-11-23 07:40:08,450 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1556 transitions. [2018-11-23 07:40:08,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 07:40:08,451 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 948 states and 1558 transitions. [2018-11-23 07:40:09,163 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1558 transitions. [2018-11-23 07:40:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 07:40:09,164 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:09,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 951 states and 1560 transitions. [2018-11-23 07:40:09,881 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1560 transitions. [2018-11-23 07:40:09,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 07:40:09,882 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:10,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 954 states and 1562 transitions. [2018-11-23 07:40:10,606 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1562 transitions. [2018-11-23 07:40:10,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 07:40:10,606 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:10,614 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 957 states and 1564 transitions. [2018-11-23 07:40:11,319 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1564 transitions. [2018-11-23 07:40:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 07:40:11,319 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:11,327 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:12,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 960 states and 1566 transitions. [2018-11-23 07:40:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1566 transitions. [2018-11-23 07:40:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 07:40:12,019 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:12,028 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:12,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:12,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 963 states and 1568 transitions. [2018-11-23 07:40:12,750 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1568 transitions. [2018-11-23 07:40:12,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 07:40:12,750 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:12,758 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 966 states and 1570 transitions. [2018-11-23 07:40:13,506 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1570 transitions. [2018-11-23 07:40:13,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 07:40:13,506 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:14,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 969 states and 1574 transitions. [2018-11-23 07:40:14,882 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1574 transitions. [2018-11-23 07:40:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 07:40:14,883 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:14,894 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:15,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:15,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 971 states and 1575 transitions. [2018-11-23 07:40:15,606 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1575 transitions. [2018-11-23 07:40:15,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 07:40:15,606 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:15,614 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:16,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 974 states and 1578 transitions. [2018-11-23 07:40:16,974 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1578 transitions. [2018-11-23 07:40:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 07:40:16,974 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:17,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 977 states and 1580 transitions. [2018-11-23 07:40:17,882 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1580 transitions. [2018-11-23 07:40:17,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 07:40:17,882 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 982 states and 1619 transitions. [2018-11-23 07:40:21,163 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1619 transitions. [2018-11-23 07:40:21,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 07:40:21,163 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:21,495 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:23,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 987 states and 1658 transitions. [2018-11-23 07:40:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1658 transitions. [2018-11-23 07:40:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 07:40:23,891 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 990 states and 1660 transitions. [2018-11-23 07:40:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1660 transitions. [2018-11-23 07:40:24,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 07:40:24,619 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:25,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 993 states and 1662 transitions. [2018-11-23 07:40:25,353 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1662 transitions. [2018-11-23 07:40:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 07:40:25,354 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:26,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:26,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 996 states and 1664 transitions. [2018-11-23 07:40:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1664 transitions. [2018-11-23 07:40:26,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 07:40:26,081 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:26,090 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:26,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 999 states and 1666 transitions. [2018-11-23 07:40:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1666 transitions. [2018-11-23 07:40:26,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 07:40:26,809 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:27,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:27,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1002 states and 1668 transitions. [2018-11-23 07:40:27,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1668 transitions. [2018-11-23 07:40:27,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 07:40:27,755 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:28,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1005 states and 1670 transitions. [2018-11-23 07:40:28,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1670 transitions. [2018-11-23 07:40:28,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 07:40:28,478 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:30,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:30,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1008 states and 1672 transitions. [2018-11-23 07:40:30,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1672 transitions. [2018-11-23 07:40:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 07:40:30,047 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:30,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1011 states and 1674 transitions. [2018-11-23 07:40:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1674 transitions. [2018-11-23 07:40:30,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 07:40:30,766 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:31,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:31,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1014 states and 1676 transitions. [2018-11-23 07:40:31,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1676 transitions. [2018-11-23 07:40:31,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 07:40:31,488 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1017 states and 1680 transitions. [2018-11-23 07:40:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1680 transitions. [2018-11-23 07:40:32,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 07:40:32,894 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:32,902 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:33,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1019 states and 1681 transitions. [2018-11-23 07:40:33,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1681 transitions. [2018-11-23 07:40:33,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 07:40:33,680 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:33,689 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1022 states and 1683 transitions. [2018-11-23 07:40:34,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1683 transitions. [2018-11-23 07:40:34,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 07:40:34,419 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:35,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1025 states and 1685 transitions. [2018-11-23 07:40:35,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1685 transitions. [2018-11-23 07:40:35,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 07:40:35,182 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1028 states and 1688 transitions. [2018-11-23 07:40:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1688 transitions. [2018-11-23 07:40:36,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 07:40:36,587 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:36,596 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:37,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1031 states and 1690 transitions. [2018-11-23 07:40:37,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1690 transitions. [2018-11-23 07:40:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 07:40:37,350 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:37,358 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:38,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:38,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1034 states and 1692 transitions. [2018-11-23 07:40:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1692 transitions. [2018-11-23 07:40:38,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 07:40:38,675 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:38,683 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:39,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1037 states and 1694 transitions. [2018-11-23 07:40:39,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1694 transitions. [2018-11-23 07:40:39,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 07:40:39,417 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:39,769 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1045 states and 1732 transitions. [2018-11-23 07:40:44,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1732 transitions. [2018-11-23 07:40:44,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 07:40:44,799 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:45,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1048 states and 1734 transitions. [2018-11-23 07:40:45,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1734 transitions. [2018-11-23 07:40:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 07:40:45,590 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1051 states and 1736 transitions. [2018-11-23 07:40:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1736 transitions. [2018-11-23 07:40:46,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 07:40:46,384 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:46,393 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1054 states and 1738 transitions. [2018-11-23 07:40:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1738 transitions. [2018-11-23 07:40:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 07:40:47,196 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:47,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1057 states and 1740 transitions. [2018-11-23 07:40:47,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1740 transitions. [2018-11-23 07:40:47,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 07:40:47,976 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:48,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1060 states and 1742 transitions. [2018-11-23 07:40:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1742 transitions. [2018-11-23 07:40:48,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 07:40:48,773 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:48,989 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:49,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1063 states and 1744 transitions. [2018-11-23 07:40:49,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1744 transitions. [2018-11-23 07:40:49,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 07:40:49,778 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:49,787 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:51,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1066 states and 1748 transitions. [2018-11-23 07:40:51,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1748 transitions. [2018-11-23 07:40:51,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 07:40:51,270 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:52,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1068 states and 1749 transitions. [2018-11-23 07:40:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1749 transitions. [2018-11-23 07:40:52,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 07:40:52,033 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:52,042 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1071 states and 1752 transitions. [2018-11-23 07:40:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1752 transitions. [2018-11-23 07:40:53,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 07:40:53,514 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1074 states and 1754 transitions. [2018-11-23 07:40:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1754 transitions. [2018-11-23 07:40:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 07:40:54,337 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:54,346 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1077 states and 1756 transitions. [2018-11-23 07:40:55,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1756 transitions. [2018-11-23 07:40:55,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 07:40:55,182 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1080 states and 1758 transitions. [2018-11-23 07:40:56,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1758 transitions. [2018-11-23 07:40:56,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 07:40:56,048 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:56,058 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:56,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1083 states and 1760 transitions. [2018-11-23 07:40:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1760 transitions. [2018-11-23 07:40:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 07:40:56,896 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1086 states and 1762 transitions. [2018-11-23 07:40:57,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1762 transitions. [2018-11-23 07:40:57,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 07:40:57,771 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:40:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1089 states and 1764 transitions. [2018-11-23 07:40:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1764 transitions. [2018-11-23 07:40:58,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 07:40:58,653 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:40:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:58,974 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1094 states and 1805 transitions. [2018-11-23 07:41:02,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1805 transitions. [2018-11-23 07:41:02,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 07:41:02,607 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:03,023 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:06,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:06,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1099 states and 1846 transitions. [2018-11-23 07:41:06,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1846 transitions. [2018-11-23 07:41:06,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 07:41:06,843 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:07,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1102 states and 1848 transitions. [2018-11-23 07:41:07,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1848 transitions. [2018-11-23 07:41:07,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 07:41:07,682 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:07,692 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:08,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1105 states and 1850 transitions. [2018-11-23 07:41:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1850 transitions. [2018-11-23 07:41:08,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 07:41:08,504 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:09,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:09,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1108 states and 1852 transitions. [2018-11-23 07:41:09,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1852 transitions. [2018-11-23 07:41:09,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 07:41:09,754 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:09,763 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1111 states and 1854 transitions. [2018-11-23 07:41:10,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1854 transitions. [2018-11-23 07:41:10,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 07:41:10,584 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:11,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:11,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1114 states and 1856 transitions. [2018-11-23 07:41:11,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1856 transitions. [2018-11-23 07:41:11,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 07:41:11,611 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:12,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1117 states and 1858 transitions. [2018-11-23 07:41:12,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1858 transitions. [2018-11-23 07:41:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 07:41:12,434 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:13,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1120 states and 1860 transitions. [2018-11-23 07:41:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1860 transitions. [2018-11-23 07:41:13,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 07:41:13,259 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1123 states and 1862 transitions. [2018-11-23 07:41:14,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1862 transitions. [2018-11-23 07:41:14,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 07:41:14,107 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:14,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:14,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1126 states and 1864 transitions. [2018-11-23 07:41:14,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1864 transitions. [2018-11-23 07:41:14,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 07:41:14,987 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1129 states and 1866 transitions. [2018-11-23 07:41:15,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1866 transitions. [2018-11-23 07:41:15,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 07:41:15,841 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:16,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1132 states and 1868 transitions. [2018-11-23 07:41:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1868 transitions. [2018-11-23 07:41:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 07:41:16,703 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:16,713 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1135 states and 1870 transitions. [2018-11-23 07:41:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1870 transitions. [2018-11-23 07:41:17,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 07:41:17,557 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:18,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:18,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1138 states and 1872 transitions. [2018-11-23 07:41:18,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1872 transitions. [2018-11-23 07:41:18,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 07:41:18,428 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:19,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1141 states and 1874 transitions. [2018-11-23 07:41:19,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1874 transitions. [2018-11-23 07:41:19,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 07:41:19,267 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1144 states and 1878 transitions. [2018-11-23 07:41:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1878 transitions. [2018-11-23 07:41:20,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 07:41:20,910 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1146 states and 1879 transitions. [2018-11-23 07:41:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1879 transitions. [2018-11-23 07:41:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 07:41:21,949 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:23,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1149 states and 1882 transitions. [2018-11-23 07:41:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1882 transitions. [2018-11-23 07:41:23,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 07:41:23,513 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:23,522 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1152 states and 1884 transitions. [2018-11-23 07:41:24,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1884 transitions. [2018-11-23 07:41:24,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 07:41:24,354 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1160 states and 1924 transitions. [2018-11-23 07:41:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1924 transitions. [2018-11-23 07:41:29,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 07:41:29,976 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:30,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1163 states and 1926 transitions. [2018-11-23 07:41:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1926 transitions. [2018-11-23 07:41:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 07:41:30,853 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:31,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1166 states and 1928 transitions. [2018-11-23 07:41:31,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1928 transitions. [2018-11-23 07:41:31,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 07:41:31,747 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:32,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:32,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1169 states and 1930 transitions. [2018-11-23 07:41:32,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1930 transitions. [2018-11-23 07:41:32,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 07:41:32,614 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:32,623 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:33,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:33,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1172 states and 1932 transitions. [2018-11-23 07:41:33,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1932 transitions. [2018-11-23 07:41:33,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 07:41:33,699 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1175 states and 1934 transitions. [2018-11-23 07:41:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1934 transitions. [2018-11-23 07:41:34,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 07:41:34,583 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:37,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1179 states and 1940 transitions. [2018-11-23 07:41:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1940 transitions. [2018-11-23 07:41:37,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 07:41:37,079 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:37,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:37,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1181 states and 1941 transitions. [2018-11-23 07:41:37,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1941 transitions. [2018-11-23 07:41:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 07:41:37,921 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:38,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:38,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1183 states and 1942 transitions. [2018-11-23 07:41:38,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1942 transitions. [2018-11-23 07:41:38,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 07:41:38,776 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:39,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1186 states and 1944 transitions. [2018-11-23 07:41:39,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1944 transitions. [2018-11-23 07:41:39,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 07:41:39,627 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1189 states and 1946 transitions. [2018-11-23 07:41:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1946 transitions. [2018-11-23 07:41:40,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 07:41:40,502 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:40,511 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:41,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1192 states and 1948 transitions. [2018-11-23 07:41:41,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1948 transitions. [2018-11-23 07:41:41,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 07:41:41,422 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:42,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1195 states and 1950 transitions. [2018-11-23 07:41:42,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1950 transitions. [2018-11-23 07:41:42,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 07:41:42,335 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:43,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:43,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1198 states and 1952 transitions. [2018-11-23 07:41:43,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1952 transitions. [2018-11-23 07:41:43,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 07:41:43,231 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:43,241 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1201 states and 1954 transitions. [2018-11-23 07:41:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1954 transitions. [2018-11-23 07:41:44,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 07:41:44,339 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:45,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:45,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1204 states and 1956 transitions. [2018-11-23 07:41:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1956 transitions. [2018-11-23 07:41:45,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 07:41:45,706 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:45,715 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 765 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:46,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1207 states and 1958 transitions. [2018-11-23 07:41:46,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1958 transitions. [2018-11-23 07:41:46,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 07:41:46,606 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 1212 states and 2001 transitions. [2018-11-23 07:41:50,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 2001 transitions. [2018-11-23 07:41:50,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 07:41:50,704 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 1217 states and 2044 transitions. [2018-11-23 07:41:54,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 2044 transitions. [2018-11-23 07:41:54,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 07:41:54,009 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:54,019 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:55,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 1220 states and 2046 transitions. [2018-11-23 07:41:55,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 2046 transitions. [2018-11-23 07:41:55,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 07:41:55,138 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:56,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 1223 states and 2048 transitions. [2018-11-23 07:41:56,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 2048 transitions. [2018-11-23 07:41:56,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 07:41:56,133 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:57,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 1226 states and 2050 transitions. [2018-11-23 07:41:57,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 2050 transitions. [2018-11-23 07:41:57,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 07:41:57,053 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:58,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:41:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 1229 states and 2052 transitions. [2018-11-23 07:41:58,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 2052 transitions. [2018-11-23 07:41:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 07:41:58,012 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:41:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:58,022 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 1232 states and 2054 transitions. [2018-11-23 07:42:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2054 transitions. [2018-11-23 07:42:00,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 07:42:00,009 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 1235 states and 2056 transitions. [2018-11-23 07:42:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 2056 transitions. [2018-11-23 07:42:01,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 07:42:01,105 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:01,117 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:02,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 1238 states and 2058 transitions. [2018-11-23 07:42:02,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 2058 transitions. [2018-11-23 07:42:02,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 07:42:02,181 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:02,192 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 1241 states and 2060 transitions. [2018-11-23 07:42:03,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 2060 transitions. [2018-11-23 07:42:03,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 07:42:03,202 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:04,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 1244 states and 2062 transitions. [2018-11-23 07:42:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 2062 transitions. [2018-11-23 07:42:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 07:42:04,238 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:04,250 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 1247 states and 2066 transitions. [2018-11-23 07:42:06,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 2066 transitions. [2018-11-23 07:42:06,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 07:42:06,441 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:07,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 1249 states and 2067 transitions. [2018-11-23 07:42:07,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 2067 transitions. [2018-11-23 07:42:07,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 07:42:07,448 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:07,459 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:09,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 1252 states and 2070 transitions. [2018-11-23 07:42:09,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 2070 transitions. [2018-11-23 07:42:09,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 07:42:09,340 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:09,351 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 1255 states and 2072 transitions. [2018-11-23 07:42:10,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 2072 transitions. [2018-11-23 07:42:10,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 07:42:10,346 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 1258 states and 2074 transitions. [2018-11-23 07:42:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 2074 transitions. [2018-11-23 07:42:11,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 07:42:11,388 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:11,399 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:12,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:12,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 1261 states and 2076 transitions. [2018-11-23 07:42:12,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 2076 transitions. [2018-11-23 07:42:12,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 07:42:12,971 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 1264 states and 2078 transitions. [2018-11-23 07:42:14,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 2078 transitions. [2018-11-23 07:42:14,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 07:42:14,042 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:15,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:15,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 1267 states and 2080 transitions. [2018-11-23 07:42:15,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 2080 transitions. [2018-11-23 07:42:15,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 07:42:15,073 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:15,084 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 1270 states and 2082 transitions. [2018-11-23 07:42:16,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 2082 transitions. [2018-11-23 07:42:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-23 07:42:16,165 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 1273 states and 2084 transitions. [2018-11-23 07:42:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 2084 transitions. [2018-11-23 07:42:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 07:42:17,243 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 1281 states and 2113 transitions. [2018-11-23 07:42:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 2113 transitions. [2018-11-23 07:42:25,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 07:42:25,260 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:27,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 1285 states and 2132 transitions. [2018-11-23 07:42:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 2132 transitions. [2018-11-23 07:42:27,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 07:42:27,483 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:28,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:28,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 1288 states and 2134 transitions. [2018-11-23 07:42:28,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 2134 transitions. [2018-11-23 07:42:28,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 07:42:28,562 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:29,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:29,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 1291 states and 2136 transitions. [2018-11-23 07:42:29,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2136 transitions. [2018-11-23 07:42:29,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 07:42:29,517 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 1294 states and 2138 transitions. [2018-11-23 07:42:31,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 2138 transitions. [2018-11-23 07:42:31,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 07:42:31,597 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 1297 states and 2140 transitions. [2018-11-23 07:42:32,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 2140 transitions. [2018-11-23 07:42:32,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 07:42:32,840 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:34,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:34,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 1300 states and 2142 transitions. [2018-11-23 07:42:34,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 2142 transitions. [2018-11-23 07:42:34,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 07:42:34,029 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 1303 states and 2144 transitions. [2018-11-23 07:42:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 2144 transitions. [2018-11-23 07:42:35,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 07:42:35,090 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:35,101 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:36,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:36,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 1306 states and 2146 transitions. [2018-11-23 07:42:36,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 2146 transitions. [2018-11-23 07:42:36,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 07:42:36,209 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 1309 states and 2148 transitions. [2018-11-23 07:42:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 2148 transitions. [2018-11-23 07:42:37,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 07:42:37,316 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:38,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 1311 states and 2149 transitions. [2018-11-23 07:42:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 2149 transitions. [2018-11-23 07:42:38,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 07:42:38,347 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:39,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 1314 states and 2151 transitions. [2018-11-23 07:42:39,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 2151 transitions. [2018-11-23 07:42:39,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 07:42:39,410 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2153 states to 1317 states and 2153 transitions. [2018-11-23 07:42:40,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 2153 transitions. [2018-11-23 07:42:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 07:42:40,491 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:40,503 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:41,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 1320 states and 2155 transitions. [2018-11-23 07:42:41,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 2155 transitions. [2018-11-23 07:42:41,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 07:42:41,590 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:41,601 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:42,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:42,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 1323 states and 2157 transitions. [2018-11-23 07:42:42,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 2157 transitions. [2018-11-23 07:42:42,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 07:42:42,653 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:42,666 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 1326 states and 2159 transitions. [2018-11-23 07:42:44,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 2159 transitions. [2018-11-23 07:42:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 07:42:44,006 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:44,017 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:45,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 1329 states and 2161 transitions. [2018-11-23 07:42:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 2161 transitions. [2018-11-23 07:42:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 07:42:45,093 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:46,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 1331 states and 2162 transitions. [2018-11-23 07:42:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2162 transitions. [2018-11-23 07:42:46,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-23 07:42:46,203 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:42:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 1336 states and 2207 transitions. [2018-11-23 07:42:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 2207 transitions. [2018-11-23 07:42:51,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 07:42:51,280 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:42:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:42:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:42:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:42:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:42:51,365 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 406 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 1;main_~y~0 := 1; VAL [ULTIMATE.start_main_~x~0=1, ULTIMATE.start_main_~y~0=1] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=1, ULTIMATE.start_main_~y~0=1] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=1, ULTIMATE.start_main_~y~0=1] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=2, ULTIMATE.start_main_~y~0=1] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=2, ULTIMATE.start_main_~y~0=1] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=2, ULTIMATE.start_main_~y~0=3] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=2, ULTIMATE.start_main_~y~0=3] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=2, ULTIMATE.start_main_~y~0=3] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=4, ULTIMATE.start_main_~y~0=3] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=4, ULTIMATE.start_main_~y~0=3] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=4, ULTIMATE.start_main_~y~0=9] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=4, ULTIMATE.start_main_~y~0=9] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=4, ULTIMATE.start_main_~y~0=9] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=8, ULTIMATE.start_main_~y~0=9] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=8, ULTIMATE.start_main_~y~0=9] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=8, ULTIMATE.start_main_~y~0=27] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=8, ULTIMATE.start_main_~y~0=27] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=8, ULTIMATE.start_main_~y~0=27] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=16, ULTIMATE.start_main_~y~0=27] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=16, ULTIMATE.start_main_~y~0=27] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=16, ULTIMATE.start_main_~y~0=81] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=16, ULTIMATE.start_main_~y~0=81] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=16, ULTIMATE.start_main_~y~0=81] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=32, ULTIMATE.start_main_~y~0=81] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=32, ULTIMATE.start_main_~y~0=81] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=32, ULTIMATE.start_main_~y~0=243] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=32, ULTIMATE.start_main_~y~0=243] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=32, ULTIMATE.start_main_~y~0=243] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=64, ULTIMATE.start_main_~y~0=243] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=64, ULTIMATE.start_main_~y~0=243] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=64, ULTIMATE.start_main_~y~0=729] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=64, ULTIMATE.start_main_~y~0=729] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=64, ULTIMATE.start_main_~y~0=729] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=128, ULTIMATE.start_main_~y~0=729] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=128, ULTIMATE.start_main_~y~0=729] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=128, ULTIMATE.start_main_~y~0=2187] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=128, ULTIMATE.start_main_~y~0=2187] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=128, ULTIMATE.start_main_~y~0=2187] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=256, ULTIMATE.start_main_~y~0=2187] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=256, ULTIMATE.start_main_~y~0=2187] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=256, ULTIMATE.start_main_~y~0=6561] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=256, ULTIMATE.start_main_~y~0=6561] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=256, ULTIMATE.start_main_~y~0=6561] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=512, ULTIMATE.start_main_~y~0=6561] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=512, ULTIMATE.start_main_~y~0=6561] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=512, ULTIMATE.start_main_~y~0=19683] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=512, ULTIMATE.start_main_~y~0=19683] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=512, ULTIMATE.start_main_~y~0=19683] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=1024, ULTIMATE.start_main_~y~0=19683] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=1024, ULTIMATE.start_main_~y~0=19683] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=1024, ULTIMATE.start_main_~y~0=59049] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=1024, ULTIMATE.start_main_~y~0=59049] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=1024, ULTIMATE.start_main_~y~0=59049] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=2048, ULTIMATE.start_main_~y~0=59049] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=2048, ULTIMATE.start_main_~y~0=59049] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=2048, ULTIMATE.start_main_~y~0=177147] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=2048, ULTIMATE.start_main_~y~0=177147] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=2048, ULTIMATE.start_main_~y~0=177147] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=4096, ULTIMATE.start_main_~y~0=177147] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=4096, ULTIMATE.start_main_~y~0=177147] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=4096, ULTIMATE.start_main_~y~0=531441] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=4096, ULTIMATE.start_main_~y~0=531441] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=4096, ULTIMATE.start_main_~y~0=531441] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=8192, ULTIMATE.start_main_~y~0=531441] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=8192, ULTIMATE.start_main_~y~0=531441] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=8192, ULTIMATE.start_main_~y~0=1594323] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=8192, ULTIMATE.start_main_~y~0=1594323] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=8192, ULTIMATE.start_main_~y~0=1594323] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=16384, ULTIMATE.start_main_~y~0=1594323] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=16384, ULTIMATE.start_main_~y~0=1594323] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=16384, ULTIMATE.start_main_~y~0=4782969] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=16384, ULTIMATE.start_main_~y~0=4782969] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=16384, ULTIMATE.start_main_~y~0=4782969] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=32768, ULTIMATE.start_main_~y~0=4782969] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=32768, ULTIMATE.start_main_~y~0=4782969] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=32768, ULTIMATE.start_main_~y~0=14348907] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=32768, ULTIMATE.start_main_~y~0=14348907] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=32768, ULTIMATE.start_main_~y~0=14348907] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=65536, ULTIMATE.start_main_~y~0=14348907] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=65536, ULTIMATE.start_main_~y~0=14348907] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=65536, ULTIMATE.start_main_~y~0=43046721] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=65536, ULTIMATE.start_main_~y~0=43046721] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=65536, ULTIMATE.start_main_~y~0=43046721] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=131072, ULTIMATE.start_main_~y~0=43046721] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=131072, ULTIMATE.start_main_~y~0=43046721] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=131072, ULTIMATE.start_main_~y~0=129140163] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=131072, ULTIMATE.start_main_~y~0=129140163] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=131072, ULTIMATE.start_main_~y~0=129140163] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=262144, ULTIMATE.start_main_~y~0=129140163] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=262144, ULTIMATE.start_main_~y~0=129140163] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=262144, ULTIMATE.start_main_~y~0=387420489] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=262144, ULTIMATE.start_main_~y~0=387420489] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=262144, ULTIMATE.start_main_~y~0=387420489] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=524288, ULTIMATE.start_main_~y~0=387420489] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=524288, ULTIMATE.start_main_~y~0=387420489] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=524288, ULTIMATE.start_main_~y~0=1162261467] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=524288, ULTIMATE.start_main_~y~0=1162261467] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=524288, ULTIMATE.start_main_~y~0=1162261467] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=1048576, ULTIMATE.start_main_~y~0=1162261467] [?] assume !(3 * main_~y~0 <= 2147483647); VAL [ULTIMATE.start_main_~x~0=1048576, ULTIMATE.start_main_~y~0=1162261467] [?] havoc main_#res; [?] havoc main_~x~0, main_~y~0; [L15] havoc main_~x~0; [L15] havoc main_~y~0; [L16] main_~x~0 := 1; [L17] main_~y~0 := 1; VAL [main_~x~0=1, main_~y~0=1] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=1, main_~y~0=1] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=1, main_~y~0=1] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=2, main_~y~0=1] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=1] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=2, main_~y~0=3] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=2, main_~y~0=3] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=3] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=4, main_~y~0=3] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=4, main_~y~0=3] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=4, main_~y~0=9] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=4, main_~y~0=9] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=4, main_~y~0=9] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=8, main_~y~0=9] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=8, main_~y~0=9] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=8, main_~y~0=27] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=8, main_~y~0=27] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=8, main_~y~0=27] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=16, main_~y~0=27] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=16, main_~y~0=27] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=16, main_~y~0=81] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=16, main_~y~0=81] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=16, main_~y~0=81] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=32, main_~y~0=81] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=32, main_~y~0=81] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=32, main_~y~0=243] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=32, main_~y~0=243] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=32, main_~y~0=243] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=64, main_~y~0=243] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=64, main_~y~0=243] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=64, main_~y~0=729] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=64, main_~y~0=729] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=64, main_~y~0=729] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=128, main_~y~0=729] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=128, main_~y~0=729] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=128, main_~y~0=2187] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=128, main_~y~0=2187] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=128, main_~y~0=2187] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=256, main_~y~0=2187] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=256, main_~y~0=2187] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=256, main_~y~0=6561] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=256, main_~y~0=6561] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=256, main_~y~0=6561] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=512, main_~y~0=6561] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=512, main_~y~0=6561] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=512, main_~y~0=19683] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=512, main_~y~0=19683] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=512, main_~y~0=19683] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=1024, main_~y~0=19683] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=1024, main_~y~0=19683] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=1024, main_~y~0=59049] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=1024, main_~y~0=59049] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=1024, main_~y~0=59049] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=2048, main_~y~0=59049] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=2048, main_~y~0=59049] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=2048, main_~y~0=177147] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=2048, main_~y~0=177147] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=2048, main_~y~0=177147] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=4096, main_~y~0=177147] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=4096, main_~y~0=177147] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=4096, main_~y~0=531441] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=4096, main_~y~0=531441] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=4096, main_~y~0=531441] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=8192, main_~y~0=531441] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=8192, main_~y~0=531441] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=8192, main_~y~0=1594323] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=8192, main_~y~0=1594323] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=8192, main_~y~0=1594323] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=16384, main_~y~0=1594323] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=16384, main_~y~0=1594323] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=16384, main_~y~0=4782969] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=16384, main_~y~0=4782969] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=16384, main_~y~0=4782969] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=32768, main_~y~0=4782969] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=32768, main_~y~0=4782969] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=32768, main_~y~0=14348907] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=32768, main_~y~0=14348907] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=32768, main_~y~0=14348907] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=65536, main_~y~0=14348907] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=65536, main_~y~0=14348907] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=65536, main_~y~0=43046721] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=65536, main_~y~0=43046721] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=65536, main_~y~0=43046721] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=131072, main_~y~0=43046721] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=131072, main_~y~0=43046721] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=131072, main_~y~0=129140163] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=131072, main_~y~0=129140163] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=131072, main_~y~0=129140163] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=262144, main_~y~0=129140163] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=262144, main_~y~0=129140163] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=262144, main_~y~0=387420489] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=262144, main_~y~0=387420489] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=262144, main_~y~0=387420489] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=524288, main_~y~0=387420489] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=524288, main_~y~0=387420489] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=524288, main_~y~0=1162261467] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=524288, main_~y~0=1162261467] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=524288, main_~y~0=1162261467] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=1048576, main_~y~0=1162261467] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=1048576, main_~y~0=1162261467] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_~x~0, main_~y~0; [L15] havoc main_~x~0; [L15] havoc main_~y~0; [L16] main_~x~0 := 1; [L17] main_~y~0 := 1; VAL [main_~x~0=1, main_~y~0=1] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=1, main_~y~0=1] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=1, main_~y~0=1] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=2, main_~y~0=1] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=1] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=2, main_~y~0=3] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=2, main_~y~0=3] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=3] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=4, main_~y~0=3] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=4, main_~y~0=3] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=4, main_~y~0=9] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=4, main_~y~0=9] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=4, main_~y~0=9] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=8, main_~y~0=9] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=8, main_~y~0=9] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=8, main_~y~0=27] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=8, main_~y~0=27] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=8, main_~y~0=27] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=16, main_~y~0=27] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=16, main_~y~0=27] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=16, main_~y~0=81] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=16, main_~y~0=81] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=16, main_~y~0=81] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=32, main_~y~0=81] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=32, main_~y~0=81] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=32, main_~y~0=243] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=32, main_~y~0=243] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=32, main_~y~0=243] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=64, main_~y~0=243] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=64, main_~y~0=243] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=64, main_~y~0=729] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=64, main_~y~0=729] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=64, main_~y~0=729] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=128, main_~y~0=729] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=128, main_~y~0=729] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=128, main_~y~0=2187] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=128, main_~y~0=2187] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=128, main_~y~0=2187] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=256, main_~y~0=2187] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=256, main_~y~0=2187] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=256, main_~y~0=6561] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=256, main_~y~0=6561] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=256, main_~y~0=6561] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=512, main_~y~0=6561] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=512, main_~y~0=6561] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=512, main_~y~0=19683] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=512, main_~y~0=19683] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=512, main_~y~0=19683] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=1024, main_~y~0=19683] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=1024, main_~y~0=19683] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=1024, main_~y~0=59049] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=1024, main_~y~0=59049] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=1024, main_~y~0=59049] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=2048, main_~y~0=59049] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=2048, main_~y~0=59049] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=2048, main_~y~0=177147] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=2048, main_~y~0=177147] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=2048, main_~y~0=177147] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=4096, main_~y~0=177147] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=4096, main_~y~0=177147] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=4096, main_~y~0=531441] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=4096, main_~y~0=531441] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=4096, main_~y~0=531441] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=8192, main_~y~0=531441] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=8192, main_~y~0=531441] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=8192, main_~y~0=1594323] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=8192, main_~y~0=1594323] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=8192, main_~y~0=1594323] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=16384, main_~y~0=1594323] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=16384, main_~y~0=1594323] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=16384, main_~y~0=4782969] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=16384, main_~y~0=4782969] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=16384, main_~y~0=4782969] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=32768, main_~y~0=4782969] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=32768, main_~y~0=4782969] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=32768, main_~y~0=14348907] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=32768, main_~y~0=14348907] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=32768, main_~y~0=14348907] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=65536, main_~y~0=14348907] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=65536, main_~y~0=14348907] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=65536, main_~y~0=43046721] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=65536, main_~y~0=43046721] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=65536, main_~y~0=43046721] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=131072, main_~y~0=43046721] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=131072, main_~y~0=43046721] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=131072, main_~y~0=129140163] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=131072, main_~y~0=129140163] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=131072, main_~y~0=129140163] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=262144, main_~y~0=129140163] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=262144, main_~y~0=129140163] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=262144, main_~y~0=387420489] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=262144, main_~y~0=387420489] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=262144, main_~y~0=387420489] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=524288, main_~y~0=387420489] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=524288, main_~y~0=387420489] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=524288, main_~y~0=1162261467] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=524288, main_~y~0=1162261467] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=524288, main_~y~0=1162261467] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=1048576, main_~y~0=1162261467] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=1048576, main_~y~0=1162261467] [?] havoc main_#res; [?] havoc main_~x~0, main_~y~0; [L15] havoc main_~x~0; [L15] havoc main_~y~0; [L16] main_~x~0 := 1; [L17] main_~y~0 := 1; VAL [main_~x~0=1, main_~y~0=1] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=1, main_~y~0=1] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=1, main_~y~0=1] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=2, main_~y~0=1] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=1] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=2, main_~y~0=3] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=2, main_~y~0=3] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=3] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=4, main_~y~0=3] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=4, main_~y~0=3] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=4, main_~y~0=9] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=4, main_~y~0=9] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=4, main_~y~0=9] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=8, main_~y~0=9] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=8, main_~y~0=9] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=8, main_~y~0=27] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=8, main_~y~0=27] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=8, main_~y~0=27] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=16, main_~y~0=27] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=16, main_~y~0=27] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=16, main_~y~0=81] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=16, main_~y~0=81] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=16, main_~y~0=81] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=32, main_~y~0=81] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=32, main_~y~0=81] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=32, main_~y~0=243] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=32, main_~y~0=243] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=32, main_~y~0=243] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=64, main_~y~0=243] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=64, main_~y~0=243] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=64, main_~y~0=729] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=64, main_~y~0=729] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=64, main_~y~0=729] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=128, main_~y~0=729] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=128, main_~y~0=729] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=128, main_~y~0=2187] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=128, main_~y~0=2187] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=128, main_~y~0=2187] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=256, main_~y~0=2187] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=256, main_~y~0=2187] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=256, main_~y~0=6561] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=256, main_~y~0=6561] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=256, main_~y~0=6561] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=512, main_~y~0=6561] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=512, main_~y~0=6561] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=512, main_~y~0=19683] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=512, main_~y~0=19683] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=512, main_~y~0=19683] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=1024, main_~y~0=19683] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=1024, main_~y~0=19683] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=1024, main_~y~0=59049] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=1024, main_~y~0=59049] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=1024, main_~y~0=59049] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=2048, main_~y~0=59049] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=2048, main_~y~0=59049] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=2048, main_~y~0=177147] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=2048, main_~y~0=177147] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=2048, main_~y~0=177147] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=4096, main_~y~0=177147] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=4096, main_~y~0=177147] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=4096, main_~y~0=531441] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=4096, main_~y~0=531441] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=4096, main_~y~0=531441] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=8192, main_~y~0=531441] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=8192, main_~y~0=531441] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=8192, main_~y~0=1594323] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=8192, main_~y~0=1594323] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=8192, main_~y~0=1594323] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=16384, main_~y~0=1594323] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=16384, main_~y~0=1594323] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=16384, main_~y~0=4782969] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=16384, main_~y~0=4782969] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=16384, main_~y~0=4782969] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=32768, main_~y~0=4782969] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=32768, main_~y~0=4782969] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=32768, main_~y~0=14348907] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=32768, main_~y~0=14348907] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=32768, main_~y~0=14348907] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=65536, main_~y~0=14348907] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=65536, main_~y~0=14348907] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=65536, main_~y~0=43046721] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=65536, main_~y~0=43046721] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=65536, main_~y~0=43046721] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=131072, main_~y~0=43046721] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=131072, main_~y~0=43046721] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=131072, main_~y~0=129140163] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=131072, main_~y~0=129140163] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=131072, main_~y~0=129140163] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=262144, main_~y~0=129140163] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=262144, main_~y~0=129140163] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=262144, main_~y~0=387420489] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=262144, main_~y~0=387420489] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=262144, main_~y~0=387420489] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=524288, main_~y~0=387420489] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=524288, main_~y~0=387420489] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=524288, main_~y~0=1162261467] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=524288, main_~y~0=1162261467] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=524288, main_~y~0=1162261467] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=1048576, main_~y~0=1162261467] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=1048576, main_~y~0=1162261467] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_~x~0, main_~y~0; [L15] havoc main_~x~0; [L15] havoc main_~y~0; [L16] main_~x~0 := 1; [L17] main_~y~0 := 1; VAL [main_~x~0=1, main_~y~0=1] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=1, main_~y~0=1] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=1, main_~y~0=1] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=2, main_~y~0=1] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=1] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=2, main_~y~0=3] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=2, main_~y~0=3] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=3] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=4, main_~y~0=3] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=4, main_~y~0=3] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=4, main_~y~0=9] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=4, main_~y~0=9] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=4, main_~y~0=9] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=8, main_~y~0=9] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=8, main_~y~0=9] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=8, main_~y~0=27] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=8, main_~y~0=27] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=8, main_~y~0=27] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=16, main_~y~0=27] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=16, main_~y~0=27] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=16, main_~y~0=81] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=16, main_~y~0=81] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=16, main_~y~0=81] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=32, main_~y~0=81] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=32, main_~y~0=81] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=32, main_~y~0=243] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=32, main_~y~0=243] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=32, main_~y~0=243] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=64, main_~y~0=243] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=64, main_~y~0=243] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=64, main_~y~0=729] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=64, main_~y~0=729] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=64, main_~y~0=729] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=128, main_~y~0=729] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=128, main_~y~0=729] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=128, main_~y~0=2187] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=128, main_~y~0=2187] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=128, main_~y~0=2187] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=256, main_~y~0=2187] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=256, main_~y~0=2187] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=256, main_~y~0=6561] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=256, main_~y~0=6561] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=256, main_~y~0=6561] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=512, main_~y~0=6561] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=512, main_~y~0=6561] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=512, main_~y~0=19683] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=512, main_~y~0=19683] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=512, main_~y~0=19683] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=1024, main_~y~0=19683] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=1024, main_~y~0=19683] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=1024, main_~y~0=59049] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=1024, main_~y~0=59049] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=1024, main_~y~0=59049] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=2048, main_~y~0=59049] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=2048, main_~y~0=59049] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=2048, main_~y~0=177147] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=2048, main_~y~0=177147] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=2048, main_~y~0=177147] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=4096, main_~y~0=177147] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=4096, main_~y~0=177147] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=4096, main_~y~0=531441] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=4096, main_~y~0=531441] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=4096, main_~y~0=531441] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=8192, main_~y~0=531441] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=8192, main_~y~0=531441] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=8192, main_~y~0=1594323] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=8192, main_~y~0=1594323] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=8192, main_~y~0=1594323] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=16384, main_~y~0=1594323] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=16384, main_~y~0=1594323] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=16384, main_~y~0=4782969] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=16384, main_~y~0=4782969] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=16384, main_~y~0=4782969] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=32768, main_~y~0=4782969] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=32768, main_~y~0=4782969] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=32768, main_~y~0=14348907] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=32768, main_~y~0=14348907] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=32768, main_~y~0=14348907] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=65536, main_~y~0=14348907] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=65536, main_~y~0=14348907] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=65536, main_~y~0=43046721] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=65536, main_~y~0=43046721] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=65536, main_~y~0=43046721] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=131072, main_~y~0=43046721] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=131072, main_~y~0=43046721] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=131072, main_~y~0=129140163] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=131072, main_~y~0=129140163] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=131072, main_~y~0=129140163] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=262144, main_~y~0=129140163] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=262144, main_~y~0=129140163] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=262144, main_~y~0=387420489] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=262144, main_~y~0=387420489] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=262144, main_~y~0=387420489] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=524288, main_~y~0=387420489] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=524288, main_~y~0=387420489] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=524288, main_~y~0=1162261467] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=524288, main_~y~0=1162261467] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=524288, main_~y~0=1162261467] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=1048576, main_~y~0=1162261467] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=1048576, main_~y~0=1162261467] [L15] havoc ~x~0; [L15] havoc ~y~0; [L16] ~x~0 := 1; [L17] ~y~0 := 1; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] havoc ~x~0; [L15] havoc ~y~0; [L16] ~x~0 := 1; [L17] ~y~0 := 1; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L15] int x, y; [L16] x = 1 [L17] y = 1 [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] 3*y ----- [2018-11-23 07:42:51,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 07:42:51 ImpRootNode [2018-11-23 07:42:51,612 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 07:42:51,612 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:42:51,612 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:42:51,612 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:42:51,613 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:37:00" (3/4) ... [2018-11-23 07:42:51,615 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 1;main_~y~0 := 1; VAL [ULTIMATE.start_main_~x~0=1, ULTIMATE.start_main_~y~0=1] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=1, ULTIMATE.start_main_~y~0=1] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=1, ULTIMATE.start_main_~y~0=1] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=2, ULTIMATE.start_main_~y~0=1] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=2, ULTIMATE.start_main_~y~0=1] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=2, ULTIMATE.start_main_~y~0=3] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=2, ULTIMATE.start_main_~y~0=3] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=2, ULTIMATE.start_main_~y~0=3] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=4, ULTIMATE.start_main_~y~0=3] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=4, ULTIMATE.start_main_~y~0=3] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=4, ULTIMATE.start_main_~y~0=9] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=4, ULTIMATE.start_main_~y~0=9] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=4, ULTIMATE.start_main_~y~0=9] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=8, ULTIMATE.start_main_~y~0=9] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=8, ULTIMATE.start_main_~y~0=9] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=8, ULTIMATE.start_main_~y~0=27] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=8, ULTIMATE.start_main_~y~0=27] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=8, ULTIMATE.start_main_~y~0=27] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=16, ULTIMATE.start_main_~y~0=27] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=16, ULTIMATE.start_main_~y~0=27] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=16, ULTIMATE.start_main_~y~0=81] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=16, ULTIMATE.start_main_~y~0=81] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=16, ULTIMATE.start_main_~y~0=81] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=32, ULTIMATE.start_main_~y~0=81] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=32, ULTIMATE.start_main_~y~0=81] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=32, ULTIMATE.start_main_~y~0=243] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=32, ULTIMATE.start_main_~y~0=243] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=32, ULTIMATE.start_main_~y~0=243] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=64, ULTIMATE.start_main_~y~0=243] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=64, ULTIMATE.start_main_~y~0=243] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=64, ULTIMATE.start_main_~y~0=729] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=64, ULTIMATE.start_main_~y~0=729] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=64, ULTIMATE.start_main_~y~0=729] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=128, ULTIMATE.start_main_~y~0=729] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=128, ULTIMATE.start_main_~y~0=729] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=128, ULTIMATE.start_main_~y~0=2187] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=128, ULTIMATE.start_main_~y~0=2187] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=128, ULTIMATE.start_main_~y~0=2187] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=256, ULTIMATE.start_main_~y~0=2187] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=256, ULTIMATE.start_main_~y~0=2187] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=256, ULTIMATE.start_main_~y~0=6561] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=256, ULTIMATE.start_main_~y~0=6561] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=256, ULTIMATE.start_main_~y~0=6561] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=512, ULTIMATE.start_main_~y~0=6561] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=512, ULTIMATE.start_main_~y~0=6561] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=512, ULTIMATE.start_main_~y~0=19683] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=512, ULTIMATE.start_main_~y~0=19683] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=512, ULTIMATE.start_main_~y~0=19683] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=1024, ULTIMATE.start_main_~y~0=19683] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=1024, ULTIMATE.start_main_~y~0=19683] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=1024, ULTIMATE.start_main_~y~0=59049] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=1024, ULTIMATE.start_main_~y~0=59049] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=1024, ULTIMATE.start_main_~y~0=59049] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=2048, ULTIMATE.start_main_~y~0=59049] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=2048, ULTIMATE.start_main_~y~0=59049] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=2048, ULTIMATE.start_main_~y~0=177147] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=2048, ULTIMATE.start_main_~y~0=177147] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=2048, ULTIMATE.start_main_~y~0=177147] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=4096, ULTIMATE.start_main_~y~0=177147] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=4096, ULTIMATE.start_main_~y~0=177147] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=4096, ULTIMATE.start_main_~y~0=531441] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=4096, ULTIMATE.start_main_~y~0=531441] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=4096, ULTIMATE.start_main_~y~0=531441] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=8192, ULTIMATE.start_main_~y~0=531441] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=8192, ULTIMATE.start_main_~y~0=531441] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=8192, ULTIMATE.start_main_~y~0=1594323] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=8192, ULTIMATE.start_main_~y~0=1594323] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=8192, ULTIMATE.start_main_~y~0=1594323] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=16384, ULTIMATE.start_main_~y~0=1594323] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=16384, ULTIMATE.start_main_~y~0=1594323] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=16384, ULTIMATE.start_main_~y~0=4782969] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=16384, ULTIMATE.start_main_~y~0=4782969] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=16384, ULTIMATE.start_main_~y~0=4782969] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=32768, ULTIMATE.start_main_~y~0=4782969] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=32768, ULTIMATE.start_main_~y~0=4782969] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=32768, ULTIMATE.start_main_~y~0=14348907] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=32768, ULTIMATE.start_main_~y~0=14348907] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=32768, ULTIMATE.start_main_~y~0=14348907] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=65536, ULTIMATE.start_main_~y~0=14348907] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=65536, ULTIMATE.start_main_~y~0=14348907] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=65536, ULTIMATE.start_main_~y~0=43046721] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=65536, ULTIMATE.start_main_~y~0=43046721] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=65536, ULTIMATE.start_main_~y~0=43046721] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=131072, ULTIMATE.start_main_~y~0=43046721] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=131072, ULTIMATE.start_main_~y~0=43046721] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=131072, ULTIMATE.start_main_~y~0=129140163] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=131072, ULTIMATE.start_main_~y~0=129140163] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=131072, ULTIMATE.start_main_~y~0=129140163] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=262144, ULTIMATE.start_main_~y~0=129140163] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=262144, ULTIMATE.start_main_~y~0=129140163] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=262144, ULTIMATE.start_main_~y~0=387420489] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=262144, ULTIMATE.start_main_~y~0=387420489] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=262144, ULTIMATE.start_main_~y~0=387420489] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=524288, ULTIMATE.start_main_~y~0=387420489] [?] assume 3 * main_~y~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=524288, ULTIMATE.start_main_~y~0=387420489] [?] assume 3 * main_~y~0 >= -2147483648;main_~y~0 := 3 * main_~y~0; VAL [ULTIMATE.start_main_~x~0=524288, ULTIMATE.start_main_~y~0=1162261467] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~x~0=524288, ULTIMATE.start_main_~y~0=1162261467] [?] assume 2 * main_~x~0 <= 2147483647; VAL [ULTIMATE.start_main_~x~0=524288, ULTIMATE.start_main_~y~0=1162261467] [?] assume 2 * main_~x~0 >= -2147483648;main_~x~0 := 2 * main_~x~0; VAL [ULTIMATE.start_main_~x~0=1048576, ULTIMATE.start_main_~y~0=1162261467] [?] assume !(3 * main_~y~0 <= 2147483647); VAL [ULTIMATE.start_main_~x~0=1048576, ULTIMATE.start_main_~y~0=1162261467] [?] havoc main_#res; [?] havoc main_~x~0, main_~y~0; [L15] havoc main_~x~0; [L15] havoc main_~y~0; [L16] main_~x~0 := 1; [L17] main_~y~0 := 1; VAL [main_~x~0=1, main_~y~0=1] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=1, main_~y~0=1] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=1, main_~y~0=1] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=2, main_~y~0=1] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=1] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=2, main_~y~0=3] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=2, main_~y~0=3] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=3] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=4, main_~y~0=3] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=4, main_~y~0=3] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=4, main_~y~0=9] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=4, main_~y~0=9] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=4, main_~y~0=9] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=8, main_~y~0=9] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=8, main_~y~0=9] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=8, main_~y~0=27] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=8, main_~y~0=27] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=8, main_~y~0=27] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=16, main_~y~0=27] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=16, main_~y~0=27] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=16, main_~y~0=81] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=16, main_~y~0=81] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=16, main_~y~0=81] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=32, main_~y~0=81] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=32, main_~y~0=81] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=32, main_~y~0=243] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=32, main_~y~0=243] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=32, main_~y~0=243] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=64, main_~y~0=243] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=64, main_~y~0=243] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=64, main_~y~0=729] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=64, main_~y~0=729] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=64, main_~y~0=729] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=128, main_~y~0=729] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=128, main_~y~0=729] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=128, main_~y~0=2187] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=128, main_~y~0=2187] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=128, main_~y~0=2187] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=256, main_~y~0=2187] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=256, main_~y~0=2187] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=256, main_~y~0=6561] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=256, main_~y~0=6561] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=256, main_~y~0=6561] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=512, main_~y~0=6561] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=512, main_~y~0=6561] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=512, main_~y~0=19683] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=512, main_~y~0=19683] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=512, main_~y~0=19683] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=1024, main_~y~0=19683] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=1024, main_~y~0=19683] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=1024, main_~y~0=59049] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=1024, main_~y~0=59049] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=1024, main_~y~0=59049] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=2048, main_~y~0=59049] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=2048, main_~y~0=59049] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=2048, main_~y~0=177147] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=2048, main_~y~0=177147] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=2048, main_~y~0=177147] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=4096, main_~y~0=177147] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=4096, main_~y~0=177147] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=4096, main_~y~0=531441] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=4096, main_~y~0=531441] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=4096, main_~y~0=531441] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=8192, main_~y~0=531441] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=8192, main_~y~0=531441] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=8192, main_~y~0=1594323] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=8192, main_~y~0=1594323] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=8192, main_~y~0=1594323] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=16384, main_~y~0=1594323] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=16384, main_~y~0=1594323] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=16384, main_~y~0=4782969] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=16384, main_~y~0=4782969] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=16384, main_~y~0=4782969] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=32768, main_~y~0=4782969] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=32768, main_~y~0=4782969] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=32768, main_~y~0=14348907] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=32768, main_~y~0=14348907] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=32768, main_~y~0=14348907] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=65536, main_~y~0=14348907] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=65536, main_~y~0=14348907] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=65536, main_~y~0=43046721] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=65536, main_~y~0=43046721] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=65536, main_~y~0=43046721] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=131072, main_~y~0=43046721] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=131072, main_~y~0=43046721] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=131072, main_~y~0=129140163] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=131072, main_~y~0=129140163] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=131072, main_~y~0=129140163] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=262144, main_~y~0=129140163] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=262144, main_~y~0=129140163] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=262144, main_~y~0=387420489] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=262144, main_~y~0=387420489] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=262144, main_~y~0=387420489] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=524288, main_~y~0=387420489] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=524288, main_~y~0=387420489] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=524288, main_~y~0=1162261467] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=524288, main_~y~0=1162261467] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=524288, main_~y~0=1162261467] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=1048576, main_~y~0=1162261467] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=1048576, main_~y~0=1162261467] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_~x~0, main_~y~0; [L15] havoc main_~x~0; [L15] havoc main_~y~0; [L16] main_~x~0 := 1; [L17] main_~y~0 := 1; VAL [main_~x~0=1, main_~y~0=1] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=1, main_~y~0=1] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=1, main_~y~0=1] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=2, main_~y~0=1] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=1] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=2, main_~y~0=3] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=2, main_~y~0=3] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=3] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=4, main_~y~0=3] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=4, main_~y~0=3] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=4, main_~y~0=9] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=4, main_~y~0=9] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=4, main_~y~0=9] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=8, main_~y~0=9] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=8, main_~y~0=9] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=8, main_~y~0=27] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=8, main_~y~0=27] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=8, main_~y~0=27] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=16, main_~y~0=27] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=16, main_~y~0=27] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=16, main_~y~0=81] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=16, main_~y~0=81] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=16, main_~y~0=81] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=32, main_~y~0=81] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=32, main_~y~0=81] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=32, main_~y~0=243] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=32, main_~y~0=243] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=32, main_~y~0=243] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=64, main_~y~0=243] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=64, main_~y~0=243] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=64, main_~y~0=729] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=64, main_~y~0=729] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=64, main_~y~0=729] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=128, main_~y~0=729] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=128, main_~y~0=729] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=128, main_~y~0=2187] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=128, main_~y~0=2187] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=128, main_~y~0=2187] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=256, main_~y~0=2187] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=256, main_~y~0=2187] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=256, main_~y~0=6561] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=256, main_~y~0=6561] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=256, main_~y~0=6561] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=512, main_~y~0=6561] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=512, main_~y~0=6561] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=512, main_~y~0=19683] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=512, main_~y~0=19683] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=512, main_~y~0=19683] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=1024, main_~y~0=19683] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=1024, main_~y~0=19683] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=1024, main_~y~0=59049] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=1024, main_~y~0=59049] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=1024, main_~y~0=59049] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=2048, main_~y~0=59049] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=2048, main_~y~0=59049] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=2048, main_~y~0=177147] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=2048, main_~y~0=177147] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=2048, main_~y~0=177147] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=4096, main_~y~0=177147] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=4096, main_~y~0=177147] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=4096, main_~y~0=531441] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=4096, main_~y~0=531441] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=4096, main_~y~0=531441] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=8192, main_~y~0=531441] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=8192, main_~y~0=531441] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=8192, main_~y~0=1594323] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=8192, main_~y~0=1594323] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=8192, main_~y~0=1594323] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=16384, main_~y~0=1594323] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=16384, main_~y~0=1594323] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=16384, main_~y~0=4782969] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=16384, main_~y~0=4782969] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=16384, main_~y~0=4782969] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=32768, main_~y~0=4782969] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=32768, main_~y~0=4782969] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=32768, main_~y~0=14348907] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=32768, main_~y~0=14348907] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=32768, main_~y~0=14348907] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=65536, main_~y~0=14348907] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=65536, main_~y~0=14348907] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=65536, main_~y~0=43046721] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=65536, main_~y~0=43046721] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=65536, main_~y~0=43046721] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=131072, main_~y~0=43046721] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=131072, main_~y~0=43046721] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=131072, main_~y~0=129140163] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=131072, main_~y~0=129140163] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=131072, main_~y~0=129140163] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=262144, main_~y~0=129140163] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=262144, main_~y~0=129140163] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=262144, main_~y~0=387420489] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=262144, main_~y~0=387420489] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=262144, main_~y~0=387420489] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=524288, main_~y~0=387420489] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=524288, main_~y~0=387420489] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=524288, main_~y~0=1162261467] [L18-L21] assume !!(main_~x~0 >= 0); VAL [main_~x~0=524288, main_~y~0=1162261467] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=524288, main_~y~0=1162261467] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=1048576, main_~y~0=1162261467] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=1048576, main_~y~0=1162261467] [?] havoc main_#res; [?] havoc main_~x~0, main_~y~0; [L15] havoc main_~x~0; [L15] havoc main_~y~0; [L16] main_~x~0 := 1; [L17] main_~y~0 := 1; VAL [main_~x~0=1, main_~y~0=1] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=1, main_~y~0=1] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=1, main_~y~0=1] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=2, main_~y~0=1] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=1] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=2, main_~y~0=3] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=2, main_~y~0=3] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=3] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=4, main_~y~0=3] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=4, main_~y~0=3] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=4, main_~y~0=9] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=4, main_~y~0=9] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=4, main_~y~0=9] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=8, main_~y~0=9] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=8, main_~y~0=9] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=8, main_~y~0=27] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=8, main_~y~0=27] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=8, main_~y~0=27] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=16, main_~y~0=27] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=16, main_~y~0=27] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=16, main_~y~0=81] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=16, main_~y~0=81] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=16, main_~y~0=81] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=32, main_~y~0=81] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=32, main_~y~0=81] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=32, main_~y~0=243] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=32, main_~y~0=243] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=32, main_~y~0=243] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=64, main_~y~0=243] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=64, main_~y~0=243] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=64, main_~y~0=729] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=64, main_~y~0=729] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=64, main_~y~0=729] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=128, main_~y~0=729] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=128, main_~y~0=729] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=128, main_~y~0=2187] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=128, main_~y~0=2187] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=128, main_~y~0=2187] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=256, main_~y~0=2187] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=256, main_~y~0=2187] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=256, main_~y~0=6561] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=256, main_~y~0=6561] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=256, main_~y~0=6561] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=512, main_~y~0=6561] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=512, main_~y~0=6561] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=512, main_~y~0=19683] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=512, main_~y~0=19683] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=512, main_~y~0=19683] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=1024, main_~y~0=19683] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=1024, main_~y~0=19683] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=1024, main_~y~0=59049] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=1024, main_~y~0=59049] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=1024, main_~y~0=59049] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=2048, main_~y~0=59049] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=2048, main_~y~0=59049] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=2048, main_~y~0=177147] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=2048, main_~y~0=177147] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=2048, main_~y~0=177147] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=4096, main_~y~0=177147] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=4096, main_~y~0=177147] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=4096, main_~y~0=531441] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=4096, main_~y~0=531441] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=4096, main_~y~0=531441] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=8192, main_~y~0=531441] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=8192, main_~y~0=531441] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=8192, main_~y~0=1594323] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=8192, main_~y~0=1594323] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=8192, main_~y~0=1594323] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=16384, main_~y~0=1594323] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=16384, main_~y~0=1594323] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=16384, main_~y~0=4782969] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=16384, main_~y~0=4782969] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=16384, main_~y~0=4782969] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=32768, main_~y~0=4782969] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=32768, main_~y~0=4782969] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=32768, main_~y~0=14348907] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=32768, main_~y~0=14348907] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=32768, main_~y~0=14348907] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=65536, main_~y~0=14348907] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=65536, main_~y~0=14348907] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=65536, main_~y~0=43046721] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=65536, main_~y~0=43046721] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=65536, main_~y~0=43046721] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=131072, main_~y~0=43046721] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=131072, main_~y~0=43046721] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=131072, main_~y~0=129140163] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=131072, main_~y~0=129140163] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=131072, main_~y~0=129140163] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=262144, main_~y~0=129140163] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=262144, main_~y~0=129140163] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=262144, main_~y~0=387420489] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=262144, main_~y~0=387420489] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=262144, main_~y~0=387420489] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=524288, main_~y~0=387420489] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=524288, main_~y~0=387420489] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=524288, main_~y~0=1162261467] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=524288, main_~y~0=1162261467] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=524288, main_~y~0=1162261467] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=1048576, main_~y~0=1162261467] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=1048576, main_~y~0=1162261467] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_~x~0, main_~y~0; [L15] havoc main_~x~0; [L15] havoc main_~y~0; [L16] main_~x~0 := 1; [L17] main_~y~0 := 1; VAL [main_~x~0=1, main_~y~0=1] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=1, main_~y~0=1] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=1, main_~y~0=1] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=2, main_~y~0=1] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=1] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=2, main_~y~0=3] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=2, main_~y~0=3] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=3] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=4, main_~y~0=3] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=4, main_~y~0=3] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=4, main_~y~0=9] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=4, main_~y~0=9] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=4, main_~y~0=9] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=8, main_~y~0=9] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=8, main_~y~0=9] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=8, main_~y~0=27] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=8, main_~y~0=27] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=8, main_~y~0=27] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=16, main_~y~0=27] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=16, main_~y~0=27] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=16, main_~y~0=81] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=16, main_~y~0=81] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=16, main_~y~0=81] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=32, main_~y~0=81] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=32, main_~y~0=81] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=32, main_~y~0=243] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=32, main_~y~0=243] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=32, main_~y~0=243] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=64, main_~y~0=243] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=64, main_~y~0=243] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=64, main_~y~0=729] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=64, main_~y~0=729] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=64, main_~y~0=729] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=128, main_~y~0=729] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=128, main_~y~0=729] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=128, main_~y~0=2187] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=128, main_~y~0=2187] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=128, main_~y~0=2187] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=256, main_~y~0=2187] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=256, main_~y~0=2187] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=256, main_~y~0=6561] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=256, main_~y~0=6561] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=256, main_~y~0=6561] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=512, main_~y~0=6561] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=512, main_~y~0=6561] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=512, main_~y~0=19683] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=512, main_~y~0=19683] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=512, main_~y~0=19683] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=1024, main_~y~0=19683] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=1024, main_~y~0=19683] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=1024, main_~y~0=59049] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=1024, main_~y~0=59049] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=1024, main_~y~0=59049] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=2048, main_~y~0=59049] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=2048, main_~y~0=59049] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=2048, main_~y~0=177147] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=2048, main_~y~0=177147] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=2048, main_~y~0=177147] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=4096, main_~y~0=177147] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=4096, main_~y~0=177147] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=4096, main_~y~0=531441] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=4096, main_~y~0=531441] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=4096, main_~y~0=531441] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=8192, main_~y~0=531441] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=8192, main_~y~0=531441] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=8192, main_~y~0=1594323] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=8192, main_~y~0=1594323] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=8192, main_~y~0=1594323] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=16384, main_~y~0=1594323] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=16384, main_~y~0=1594323] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=16384, main_~y~0=4782969] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=16384, main_~y~0=4782969] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=16384, main_~y~0=4782969] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=32768, main_~y~0=4782969] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=32768, main_~y~0=4782969] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=32768, main_~y~0=14348907] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=32768, main_~y~0=14348907] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=32768, main_~y~0=14348907] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=65536, main_~y~0=14348907] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=65536, main_~y~0=14348907] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=65536, main_~y~0=43046721] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=65536, main_~y~0=43046721] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=65536, main_~y~0=43046721] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=131072, main_~y~0=43046721] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=131072, main_~y~0=43046721] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=131072, main_~y~0=129140163] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=131072, main_~y~0=129140163] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=131072, main_~y~0=129140163] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=262144, main_~y~0=129140163] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=262144, main_~y~0=129140163] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=262144, main_~y~0=387420489] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=262144, main_~y~0=387420489] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=262144, main_~y~0=387420489] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=524288, main_~y~0=387420489] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=524288, main_~y~0=387420489] [L20] assert 3 * main_~y~0 >= -2147483648; [L20] main_~y~0 := 3 * main_~y~0; VAL [main_~x~0=524288, main_~y~0=1162261467] [L18-L21] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~x~0=524288, main_~y~0=1162261467] [L19] assert 2 * main_~x~0 <= 2147483647; VAL [main_~x~0=524288, main_~y~0=1162261467] [L19] assert 2 * main_~x~0 >= -2147483648; [L19] main_~x~0 := 2 * main_~x~0; VAL [main_~x~0=1048576, main_~y~0=1162261467] [L20] assert 3 * main_~y~0 <= 2147483647; VAL [main_~x~0=1048576, main_~y~0=1162261467] [L15] havoc ~x~0; [L15] havoc ~y~0; [L16] ~x~0 := 1; [L17] ~y~0 := 1; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] havoc ~x~0; [L15] havoc ~y~0; [L16] ~x~0 := 1; [L17] ~y~0 := 1; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; [L18-L21] COND FALSE !(!(~x~0 >= 0)) [L19] assert 2 * ~x~0 <= 2147483647; [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; [L20] assert 3 * ~y~0 <= 2147483647; [L15] int x, y; [L16] x = 1 [L17] y = 1 [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] 3*y ----- [2018-11-23 07:42:52,546 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_774d60a5-75be-460e-93d5-92f956769576/bin-2019/ukojak/witness.graphml [2018-11-23 07:42:52,546 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:42:52,547 INFO L168 Benchmark]: Toolchain (without parser) took 352083.06 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 959.1 MB in the beginning and 1.5 GB in the end (delta: -587.2 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-11-23 07:42:52,548 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:42:52,548 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.84 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:42:52,548 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.21 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:42:52,548 INFO L168 Benchmark]: Boogie Preprocessor took 10.74 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:42:52,562 INFO L168 Benchmark]: RCFGBuilder took 165.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2018-11-23 07:42:52,562 INFO L168 Benchmark]: CodeCheck took 350812.37 ms. Allocated memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -442.2 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-11-23 07:42:52,562 INFO L168 Benchmark]: Witness Printer took 934.07 ms. Allocated memory is still 4.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 2.8 kB). Peak memory consumption was 2.8 kB. Max. memory is 11.5 GB. [2018-11-23 07:42:52,564 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 14 locations, 4 error locations. UNSAFE Result, 350.5s OverallTime, 406 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, -1187513290 SDslu, 0 SDs, 0 SdLazy, 1001388248 SolverSat, 271581190 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 876.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 339340 GetRequests, 312350 SyntacticMatches, 24288 SemanticMatches, 2702 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4073177 ImplicationChecksByTransitivity, 332.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 26098 NumberOfCodeBlocks, 26098 NumberOfCodeBlocksAsserted, 406 NumberOfCheckSat, 25593 ConstructedInterpolants, 0 QuantifiedInterpolants, 5547717 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 405 InterpolantComputations, 179 PerfectInterpolantSequences, 78823/172227 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 20]: integer overflow possible integer overflow possible We found a FailurePath: [L15] int x, y; [L16] x = 1 [L17] y = 1 [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] EXPR 3*y [L20] y = 3*y [L18] COND TRUE x >= 0 [L19] EXPR 2*x [L19] x = 2*x [L20] 3*y * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 139.84 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.21 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.74 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 165.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * CodeCheck took 350812.37 ms. Allocated memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -442.2 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 934.07 ms. Allocated memory is still 4.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 2.8 kB). Peak memory consumption was 2.8 kB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...