./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label00_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label00_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a51f684c5d1dac1e77d78cf59294c9ff02da6095 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 01:34:59,271 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 01:34:59,272 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 01:34:59,278 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 01:34:59,278 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 01:34:59,278 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 01:34:59,279 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 01:34:59,280 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 01:34:59,281 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 01:34:59,281 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 01:34:59,282 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 01:34:59,282 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 01:34:59,282 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 01:34:59,283 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 01:34:59,283 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 01:34:59,284 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 01:34:59,284 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 01:34:59,285 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 01:34:59,286 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 01:34:59,287 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 01:34:59,287 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 01:34:59,288 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 01:34:59,289 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 01:34:59,289 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 01:34:59,289 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 01:34:59,290 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 01:34:59,290 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 01:34:59,291 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 01:34:59,291 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 01:34:59,292 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 01:34:59,292 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 01:34:59,292 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 01:34:59,292 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 01:34:59,292 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 01:34:59,293 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 01:34:59,293 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 01:34:59,293 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 01:34:59,300 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 01:34:59,301 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 01:34:59,301 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 01:34:59,301 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 01:34:59,301 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 01:34:59,301 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 01:34:59,301 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 01:34:59,302 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 01:34:59,302 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 01:34:59,302 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 01:34:59,302 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 01:34:59,302 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 01:34:59,302 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 01:34:59,302 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 01:34:59,302 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 01:34:59,303 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 01:34:59,303 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 01:34:59,303 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 01:34:59,303 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 01:34:59,303 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 01:34:59,303 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 01:34:59,303 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 01:34:59,303 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 01:34:59,303 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 01:34:59,303 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 01:34:59,303 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 01:34:59,304 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 01:34:59,304 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 01:34:59,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 01:34:59,304 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 01:34:59,304 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 01:34:59,304 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 01:34:59,304 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 01:34:59,304 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 01:34:59,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 01:34:59,304 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 01:34:59,304 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a51f684c5d1dac1e77d78cf59294c9ff02da6095 [2018-12-02 01:34:59,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 01:34:59,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 01:34:59,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 01:34:59,335 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 01:34:59,335 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 01:34:59,336 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem11_label00_false-unreach-call.c [2018-12-02 01:34:59,376 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/data/fa8126d43/4176b90fb8694642b6395a6fa7029bdd/FLAG4d3c6b3cb [2018-12-02 01:34:59,859 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 01:34:59,859 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/sv-benchmarks/c/eca-rers2012/Problem11_label00_false-unreach-call.c [2018-12-02 01:34:59,869 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/data/fa8126d43/4176b90fb8694642b6395a6fa7029bdd/FLAG4d3c6b3cb [2018-12-02 01:34:59,881 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/data/fa8126d43/4176b90fb8694642b6395a6fa7029bdd [2018-12-02 01:34:59,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 01:34:59,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 01:34:59,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 01:34:59,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 01:34:59,889 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 01:34:59,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:34:59" (1/1) ... [2018-12-02 01:34:59,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d10e54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:34:59, skipping insertion in model container [2018-12-02 01:34:59,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:34:59" (1/1) ... [2018-12-02 01:34:59,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 01:34:59,939 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 01:35:00,179 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:35:00,182 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 01:35:00,316 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:35:00,325 INFO L195 MainTranslator]: Completed translation [2018-12-02 01:35:00,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:00 WrapperNode [2018-12-02 01:35:00,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 01:35:00,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 01:35:00,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 01:35:00,326 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 01:35:00,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:00" (1/1) ... [2018-12-02 01:35:00,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:00" (1/1) ... [2018-12-02 01:35:00,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 01:35:00,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 01:35:00,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 01:35:00,355 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 01:35:00,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:00" (1/1) ... [2018-12-02 01:35:00,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:00" (1/1) ... [2018-12-02 01:35:00,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:00" (1/1) ... [2018-12-02 01:35:00,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:00" (1/1) ... [2018-12-02 01:35:00,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:00" (1/1) ... [2018-12-02 01:35:00,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:00" (1/1) ... [2018-12-02 01:35:00,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:00" (1/1) ... [2018-12-02 01:35:00,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 01:35:00,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 01:35:00,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 01:35:00,417 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 01:35:00,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 01:35:00,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 01:35:00,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 01:35:00,458 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-02 01:35:00,458 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-02 01:35:00,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 01:35:00,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 01:35:00,459 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 01:35:00,459 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 01:35:01,365 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 01:35:01,366 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 01:35:01,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:35:01 BoogieIcfgContainer [2018-12-02 01:35:01,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 01:35:01,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 01:35:01,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 01:35:01,369 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 01:35:01,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:34:59" (1/3) ... [2018-12-02 01:35:01,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185fa3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:35:01, skipping insertion in model container [2018-12-02 01:35:01,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:35:00" (2/3) ... [2018-12-02 01:35:01,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185fa3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:35:01, skipping insertion in model container [2018-12-02 01:35:01,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:35:01" (3/3) ... [2018-12-02 01:35:01,372 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label00_false-unreach-call.c [2018-12-02 01:35:01,378 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 01:35:01,384 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 01:35:01,395 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 01:35:01,419 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 01:35:01,419 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 01:35:01,419 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 01:35:01,420 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 01:35:01,420 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 01:35:01,420 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 01:35:01,420 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 01:35:01,420 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 01:35:01,438 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2018-12-02 01:35:01,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 01:35:01,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:35:01,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:35:01,444 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:35:01,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:35:01,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1199461691, now seen corresponding path program 1 times [2018-12-02 01:35:01,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:35:01,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:35:01,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:35:01,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:35:01,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:35:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:35:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:35:01,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:35:01,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:35:01,569 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:35:01,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:35:01,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:35:01,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:35:01,581 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 3 states. [2018-12-02 01:35:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:35:02,287 INFO L93 Difference]: Finished difference Result 780 states and 1368 transitions. [2018-12-02 01:35:02,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:35:02,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-02 01:35:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:35:02,297 INFO L225 Difference]: With dead ends: 780 [2018-12-02 01:35:02,297 INFO L226 Difference]: Without dead ends: 425 [2018-12-02 01:35:02,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:35:02,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-12-02 01:35:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2018-12-02 01:35:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-12-02 01:35:02,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 613 transitions. [2018-12-02 01:35:02,336 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 613 transitions. Word has length 12 [2018-12-02 01:35:02,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:35:02,337 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 613 transitions. [2018-12-02 01:35:02,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:35:02,337 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 613 transitions. [2018-12-02 01:35:02,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 01:35:02,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:35:02,339 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:35:02,339 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:35:02,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:35:02,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1236212934, now seen corresponding path program 1 times [2018-12-02 01:35:02,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:35:02,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:35:02,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:35:02,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:35:02,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:35:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:35:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:35:02,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:35:02,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:35:02,456 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:35:02,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:35:02,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:35:02,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:35:02,457 INFO L87 Difference]: Start difference. First operand 425 states and 613 transitions. Second operand 6 states. [2018-12-02 01:35:03,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:35:03,163 INFO L93 Difference]: Finished difference Result 1248 states and 1821 transitions. [2018-12-02 01:35:03,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 01:35:03,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2018-12-02 01:35:03,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:35:03,167 INFO L225 Difference]: With dead ends: 1248 [2018-12-02 01:35:03,167 INFO L226 Difference]: Without dead ends: 829 [2018-12-02 01:35:03,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 01:35:03,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2018-12-02 01:35:03,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 816. [2018-12-02 01:35:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2018-12-02 01:35:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1166 transitions. [2018-12-02 01:35:03,194 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1166 transitions. Word has length 84 [2018-12-02 01:35:03,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:35:03,194 INFO L480 AbstractCegarLoop]: Abstraction has 816 states and 1166 transitions. [2018-12-02 01:35:03,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:35:03,194 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1166 transitions. [2018-12-02 01:35:03,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 01:35:03,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:35:03,195 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:35:03,195 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:35:03,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:35:03,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1728006093, now seen corresponding path program 1 times [2018-12-02 01:35:03,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:35:03,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:35:03,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:35:03,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:35:03,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:35:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:35:03,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:35:03,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:35:03,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:35:03,252 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:35:03,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:35:03,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:35:03,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:35:03,253 INFO L87 Difference]: Start difference. First operand 816 states and 1166 transitions. Second operand 3 states. [2018-12-02 01:35:03,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:35:03,809 INFO L93 Difference]: Finished difference Result 2024 states and 2914 transitions. [2018-12-02 01:35:03,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:35:03,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-12-02 01:35:03,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:35:03,814 INFO L225 Difference]: With dead ends: 2024 [2018-12-02 01:35:03,814 INFO L226 Difference]: Without dead ends: 1214 [2018-12-02 01:35:03,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:35:03,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2018-12-02 01:35:03,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1204. [2018-12-02 01:35:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2018-12-02 01:35:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1653 transitions. [2018-12-02 01:35:03,842 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1653 transitions. Word has length 85 [2018-12-02 01:35:03,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:35:03,842 INFO L480 AbstractCegarLoop]: Abstraction has 1204 states and 1653 transitions. [2018-12-02 01:35:03,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:35:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1653 transitions. [2018-12-02 01:35:03,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-02 01:35:03,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:35:03,844 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:35:03,844 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:35:03,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:35:03,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1656538602, now seen corresponding path program 1 times [2018-12-02 01:35:03,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:35:03,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:35:03,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:35:03,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:35:03,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:35:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:35:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:35:03,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:35:03,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:35:03,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:35:03,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:35:03,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:35:03,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:35:03,891 INFO L87 Difference]: Start difference. First operand 1204 states and 1653 transitions. Second operand 3 states. [2018-12-02 01:35:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:35:04,459 INFO L93 Difference]: Finished difference Result 2792 states and 3886 transitions. [2018-12-02 01:35:04,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:35:04,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-12-02 01:35:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:35:04,466 INFO L225 Difference]: With dead ends: 2792 [2018-12-02 01:35:04,466 INFO L226 Difference]: Without dead ends: 1594 [2018-12-02 01:35:04,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:35:04,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2018-12-02 01:35:04,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1588. [2018-12-02 01:35:04,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2018-12-02 01:35:04,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2140 transitions. [2018-12-02 01:35:04,501 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2140 transitions. Word has length 86 [2018-12-02 01:35:04,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:35:04,502 INFO L480 AbstractCegarLoop]: Abstraction has 1588 states and 2140 transitions. [2018-12-02 01:35:04,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:35:04,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2140 transitions. [2018-12-02 01:35:04,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 01:35:04,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:35:04,503 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:35:04,503 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:35:04,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:35:04,504 INFO L82 PathProgramCache]: Analyzing trace with hash -880062806, now seen corresponding path program 1 times [2018-12-02 01:35:04,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:35:04,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:35:04,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:35:04,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:35:04,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:35:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:35:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:35:04,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:35:04,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:35:04,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:35:04,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:35:04,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:35:04,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:35:04,575 INFO L87 Difference]: Start difference. First operand 1588 states and 2140 transitions. Second operand 6 states. [2018-12-02 01:35:05,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:35:05,986 INFO L93 Difference]: Finished difference Result 4376 states and 6131 transitions. [2018-12-02 01:35:05,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 01:35:05,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-02 01:35:05,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:35:06,001 INFO L225 Difference]: With dead ends: 4376 [2018-12-02 01:35:06,001 INFO L226 Difference]: Without dead ends: 2794 [2018-12-02 01:35:06,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:35:06,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2794 states. [2018-12-02 01:35:06,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2794 to 2779. [2018-12-02 01:35:06,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2779 states. [2018-12-02 01:35:06,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 3612 transitions. [2018-12-02 01:35:06,049 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 3612 transitions. Word has length 92 [2018-12-02 01:35:06,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:35:06,050 INFO L480 AbstractCegarLoop]: Abstraction has 2779 states and 3612 transitions. [2018-12-02 01:35:06,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:35:06,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3612 transitions. [2018-12-02 01:35:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-02 01:35:06,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:35:06,052 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:35:06,052 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:35:06,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:35:06,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1041565358, now seen corresponding path program 1 times [2018-12-02 01:35:06,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:35:06,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:35:06,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:35:06,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:35:06,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:35:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:35:06,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:35:06,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:35:06,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 01:35:06,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:35:06,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 01:35:06,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 01:35:06,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:35:06,250 INFO L87 Difference]: Start difference. First operand 2779 states and 3612 transitions. Second operand 7 states. [2018-12-02 01:35:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:35:07,195 INFO L93 Difference]: Finished difference Result 5673 states and 7745 transitions. [2018-12-02 01:35:07,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 01:35:07,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2018-12-02 01:35:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:35:07,206 INFO L225 Difference]: With dead ends: 5673 [2018-12-02 01:35:07,206 INFO L226 Difference]: Without dead ends: 2900 [2018-12-02 01:35:07,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-12-02 01:35:07,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2018-12-02 01:35:07,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 2832. [2018-12-02 01:35:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2832 states. [2018-12-02 01:35:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2832 states to 2832 states and 3724 transitions. [2018-12-02 01:35:07,258 INFO L78 Accepts]: Start accepts. Automaton has 2832 states and 3724 transitions. Word has length 106 [2018-12-02 01:35:07,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:35:07,258 INFO L480 AbstractCegarLoop]: Abstraction has 2832 states and 3724 transitions. [2018-12-02 01:35:07,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 01:35:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 3724 transitions. [2018-12-02 01:35:07,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-02 01:35:07,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:35:07,260 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:35:07,260 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:35:07,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:35:07,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1974589244, now seen corresponding path program 1 times [2018-12-02 01:35:07,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:35:07,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:35:07,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:35:07,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:35:07,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:35:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:35:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:35:07,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:35:07,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:35:07,340 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2018-12-02 01:35:07,342 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 01:35:07,369 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:35:07,369 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:35:07,906 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:35:07,907 INFO L272 AbstractInterpreter]: Visited 139 different actions 403 times. Merged at 4 different actions 7 times. Never widened. Performed 5623 root evaluator evaluations with a maximum evaluation depth of 9. Performed 5623 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-02 01:35:07,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:35:07,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:35:07,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:35:07,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:35:07,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:35:07,927 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:35:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:35:07,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:35:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:35:08,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:35:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:35:08,083 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 01:35:08,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2018-12-02 01:35:08,083 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:35:08,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:35:08,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:35:08,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-02 01:35:08,084 INFO L87 Difference]: Start difference. First operand 2832 states and 3724 transitions. Second operand 3 states. [2018-12-02 01:35:08,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:35:08,675 INFO L93 Difference]: Finished difference Result 6441 states and 8614 transitions. [2018-12-02 01:35:08,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:35:08,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2018-12-02 01:35:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:35:08,686 INFO L225 Difference]: With dead ends: 6441 [2018-12-02 01:35:08,686 INFO L226 Difference]: Without dead ends: 3615 [2018-12-02 01:35:08,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-02 01:35:08,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2018-12-02 01:35:08,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 3414. [2018-12-02 01:35:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3414 states. [2018-12-02 01:35:08,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3414 states to 3414 states and 4474 transitions. [2018-12-02 01:35:08,736 INFO L78 Accepts]: Start accepts. Automaton has 3414 states and 4474 transitions. Word has length 143 [2018-12-02 01:35:08,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:35:08,736 INFO L480 AbstractCegarLoop]: Abstraction has 3414 states and 4474 transitions. [2018-12-02 01:35:08,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:35:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3414 states and 4474 transitions. [2018-12-02 01:35:08,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-02 01:35:08,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:35:08,739 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:35:08,739 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:35:08,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:35:08,739 INFO L82 PathProgramCache]: Analyzing trace with hash 852307655, now seen corresponding path program 1 times [2018-12-02 01:35:08,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:35:08,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:35:08,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:35:08,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:35:08,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:35:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:35:08,934 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:35:08,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:35:08,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:35:08,935 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-12-02 01:35:08,935 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 01:35:08,938 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:35:08,938 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:35:09,437 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:35:09,437 INFO L272 AbstractInterpreter]: Visited 125 different actions 370 times. Merged at 6 different actions 17 times. Never widened. Performed 4919 root evaluator evaluations with a maximum evaluation depth of 16. Performed 4919 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-02 01:35:09,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:35:09,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:35:09,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:35:09,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:35:09,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:35:09,447 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:35:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:35:09,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:35:12,735 WARN L180 SmtUtils]: Spent 3.16 s on a formula simplification. DAG size of input: 152 DAG size of output: 28 [2018-12-02 01:35:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 11 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:35:12,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:35:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 11 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:35:13,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:35:13,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-02 01:35:13,493 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:35:13,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 01:35:13,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 01:35:13,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-12-02 01:35:13,494 INFO L87 Difference]: Start difference. First operand 3414 states and 4474 transitions. Second operand 16 states. [2018-12-02 01:35:13,949 WARN L180 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 24 [2018-12-02 01:35:49,499 WARN L180 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 22 [2018-12-02 01:35:54,074 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2018-12-02 01:35:55,611 WARN L180 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-12-02 01:37:24,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:24,684 INFO L93 Difference]: Finished difference Result 13037 states and 21140 transitions. [2018-12-02 01:37:24,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-02 01:37:24,685 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 222 [2018-12-02 01:37:24,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:24,720 INFO L225 Difference]: With dead ends: 13037 [2018-12-02 01:37:24,720 INFO L226 Difference]: Without dead ends: 9433 [2018-12-02 01:37:24,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 435 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4359 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=1841, Invalid=10586, Unknown=5, NotChecked=0, Total=12432 [2018-12-02 01:37:24,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9433 states. [2018-12-02 01:37:24,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9433 to 8695. [2018-12-02 01:37:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8695 states. [2018-12-02 01:37:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8695 states to 8695 states and 11298 transitions. [2018-12-02 01:37:24,892 INFO L78 Accepts]: Start accepts. Automaton has 8695 states and 11298 transitions. Word has length 222 [2018-12-02 01:37:24,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:24,892 INFO L480 AbstractCegarLoop]: Abstraction has 8695 states and 11298 transitions. [2018-12-02 01:37:24,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 01:37:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 8695 states and 11298 transitions. [2018-12-02 01:37:24,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-02 01:37:24,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:24,894 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:37:24,894 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:24,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:24,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1697778707, now seen corresponding path program 1 times [2018-12-02 01:37:24,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:24,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:24,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:24,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:24,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:25,100 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:37:25,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:37:25,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:37:25,101 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2018-12-02 01:37:25,101 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 01:37:25,104 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:37:25,105 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:37:25,392 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:37:25,393 INFO L272 AbstractInterpreter]: Visited 135 different actions 396 times. Merged at 6 different actions 13 times. Never widened. Performed 5275 root evaluator evaluations with a maximum evaluation depth of 13. Performed 5275 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-02 01:37:25,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:25,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:37:25,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:37:25,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:37:25,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:25,403 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:37:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:25,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:37:25,638 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 11 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:37:25,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:37:26,087 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 11 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:37:26,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:37:26,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-02 01:37:26,102 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:37:26,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 01:37:26,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 01:37:26,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-12-02 01:37:26,103 INFO L87 Difference]: Start difference. First operand 8695 states and 11298 transitions. Second operand 16 states. [2018-12-02 01:37:27,037 WARN L180 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-12-02 01:37:28,306 WARN L180 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-12-02 01:37:29,019 WARN L180 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2018-12-02 01:37:29,594 WARN L180 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-12-02 01:37:30,173 WARN L180 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2018-12-02 01:37:30,644 WARN L180 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-02 01:37:31,137 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2018-12-02 01:37:32,310 WARN L180 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2018-12-02 01:37:33,369 WARN L180 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-02 01:37:33,683 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-12-02 01:37:34,178 WARN L180 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-12-02 01:37:35,132 WARN L180 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-12-02 01:37:44,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:44,914 INFO L93 Difference]: Finished difference Result 20592 states and 30095 transitions. [2018-12-02 01:37:44,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-02 01:37:44,914 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 232 [2018-12-02 01:37:44,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:44,945 INFO L225 Difference]: With dead ends: 20592 [2018-12-02 01:37:44,945 INFO L226 Difference]: Without dead ends: 12281 [2018-12-02 01:37:44,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 455 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4527 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1966, Invalid=10690, Unknown=0, NotChecked=0, Total=12656 [2018-12-02 01:37:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12281 states. [2018-12-02 01:37:45,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12281 to 11738. [2018-12-02 01:37:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11738 states. [2018-12-02 01:37:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11738 states to 11738 states and 15070 transitions. [2018-12-02 01:37:45,121 INFO L78 Accepts]: Start accepts. Automaton has 11738 states and 15070 transitions. Word has length 232 [2018-12-02 01:37:45,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:45,121 INFO L480 AbstractCegarLoop]: Abstraction has 11738 states and 15070 transitions. [2018-12-02 01:37:45,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 01:37:45,121 INFO L276 IsEmpty]: Start isEmpty. Operand 11738 states and 15070 transitions. [2018-12-02 01:37:45,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-02 01:37:45,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:45,123 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:37:45,123 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:45,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:45,124 INFO L82 PathProgramCache]: Analyzing trace with hash 510977348, now seen corresponding path program 1 times [2018-12-02 01:37:45,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:45,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:45,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:45,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:45,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-02 01:37:45,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:37:45,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:37:45,261 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2018-12-02 01:37:45,261 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [574], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 01:37:45,263 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:37:45,263 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:37:45,541 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:37:45,541 INFO L272 AbstractInterpreter]: Visited 140 different actions 548 times. Merged at 6 different actions 19 times. Never widened. Performed 7707 root evaluator evaluations with a maximum evaluation depth of 9. Performed 7707 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 4 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-02 01:37:45,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:45,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:37:45,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:37:45,549 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:37:45,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:45,558 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:37:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:45,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:37:45,670 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:37:45,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:37:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:37:45,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:37:45,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-12-02 01:37:45,741 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:37:45,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 01:37:45,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 01:37:45,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-02 01:37:45,741 INFO L87 Difference]: Start difference. First operand 11738 states and 15070 transitions. Second operand 11 states. [2018-12-02 01:37:47,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:37:47,953 INFO L93 Difference]: Finished difference Result 33116 states and 44387 transitions. [2018-12-02 01:37:47,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 01:37:47,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 232 [2018-12-02 01:37:47,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:37:47,985 INFO L225 Difference]: With dead ends: 33116 [2018-12-02 01:37:47,985 INFO L226 Difference]: Without dead ends: 21762 [2018-12-02 01:37:47,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 466 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2018-12-02 01:37:48,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states. [2018-12-02 01:37:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 18376. [2018-12-02 01:37:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18376 states. [2018-12-02 01:37:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18376 states to 18376 states and 23817 transitions. [2018-12-02 01:37:48,205 INFO L78 Accepts]: Start accepts. Automaton has 18376 states and 23817 transitions. Word has length 232 [2018-12-02 01:37:48,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:37:48,205 INFO L480 AbstractCegarLoop]: Abstraction has 18376 states and 23817 transitions. [2018-12-02 01:37:48,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 01:37:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand 18376 states and 23817 transitions. [2018-12-02 01:37:48,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-02 01:37:48,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:37:48,208 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:37:48,208 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:37:48,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:48,208 INFO L82 PathProgramCache]: Analyzing trace with hash -55547616, now seen corresponding path program 1 times [2018-12-02 01:37:48,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:37:48,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:48,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:48,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:37:48,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:37:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:37:48,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:37:48,402 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:37:48,402 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2018-12-02 01:37:48,403 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [582], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 01:37:48,404 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:37:48,404 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:37:48,657 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:37:48,657 INFO L272 AbstractInterpreter]: Visited 140 different actions 547 times. Merged at 6 different actions 18 times. Never widened. Performed 7698 root evaluator evaluations with a maximum evaluation depth of 9. Performed 7698 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 4 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-02 01:37:48,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:37:48,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:37:48,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:37:48,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:37:48,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:37:48,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:37:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:37:48,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:37:49,684 WARN L180 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 39 [2018-12-02 01:37:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 88 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:37:49,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:37:50,041 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:37:50,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:37:50,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 21 [2018-12-02 01:37:50,056 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:37:50,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 01:37:50,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 01:37:50,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-12-02 01:37:50,057 INFO L87 Difference]: Start difference. First operand 18376 states and 23817 transitions. Second operand 15 states. [2018-12-02 01:37:53,566 WARN L180 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-12-02 01:37:54,896 WARN L180 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2018-12-02 01:37:55,867 WARN L180 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2018-12-02 01:38:02,605 WARN L180 SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2018-12-02 01:38:06,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:38:06,069 INFO L93 Difference]: Finished difference Result 38984 states and 52814 transitions. [2018-12-02 01:38:06,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-02 01:38:06,070 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 234 [2018-12-02 01:38:06,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:38:06,107 INFO L225 Difference]: With dead ends: 38984 [2018-12-02 01:38:06,107 INFO L226 Difference]: Without dead ends: 20992 [2018-12-02 01:38:06,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 461 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=547, Invalid=1615, Unknown=0, NotChecked=0, Total=2162 [2018-12-02 01:38:06,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20992 states. [2018-12-02 01:38:06,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20992 to 20131. [2018-12-02 01:38:06,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20131 states. [2018-12-02 01:38:06,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20131 states to 20131 states and 25516 transitions. [2018-12-02 01:38:06,393 INFO L78 Accepts]: Start accepts. Automaton has 20131 states and 25516 transitions. Word has length 234 [2018-12-02 01:38:06,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:38:06,394 INFO L480 AbstractCegarLoop]: Abstraction has 20131 states and 25516 transitions. [2018-12-02 01:38:06,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 01:38:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 20131 states and 25516 transitions. [2018-12-02 01:38:06,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-02 01:38:06,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:38:06,396 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:38:06,396 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:38:06,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:38:06,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1764883575, now seen corresponding path program 1 times [2018-12-02 01:38:06,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:38:06,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:38:06,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:38:06,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:38:06,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:38:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:38:06,595 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 16 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:38:06,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:38:06,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:38:06,595 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 238 with the following transitions: [2018-12-02 01:38:06,596 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 01:38:06,598 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:38:06,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:38:06,815 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:38:06,815 INFO L272 AbstractInterpreter]: Visited 140 different actions 414 times. Merged at 6 different actions 15 times. Never widened. Performed 5756 root evaluator evaluations with a maximum evaluation depth of 13. Performed 5756 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 3 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-02 01:38:06,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:38:06,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:38:06,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:38:06,817 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:38:06,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:38:06,823 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:38:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:38:06,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:38:06,947 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:38:06,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:38:07,268 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 11 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:38:07,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:38:07,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2018-12-02 01:38:07,292 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:38:07,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 01:38:07,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 01:38:07,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-12-02 01:38:07,292 INFO L87 Difference]: Start difference. First operand 20131 states and 25516 transitions. Second operand 16 states. [2018-12-02 01:38:10,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:38:10,751 INFO L93 Difference]: Finished difference Result 48697 states and 67863 transitions. [2018-12-02 01:38:10,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-02 01:38:10,751 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 237 [2018-12-02 01:38:10,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:38:10,814 INFO L225 Difference]: With dead ends: 48697 [2018-12-02 01:38:10,814 INFO L226 Difference]: Without dead ends: 28756 [2018-12-02 01:38:10,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 465 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=852, Invalid=3054, Unknown=0, NotChecked=0, Total=3906 [2018-12-02 01:38:10,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28756 states. [2018-12-02 01:38:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28756 to 27833. [2018-12-02 01:38:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27833 states. [2018-12-02 01:38:11,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27833 states to 27833 states and 35248 transitions. [2018-12-02 01:38:11,274 INFO L78 Accepts]: Start accepts. Automaton has 27833 states and 35248 transitions. Word has length 237 [2018-12-02 01:38:11,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:38:11,275 INFO L480 AbstractCegarLoop]: Abstraction has 27833 states and 35248 transitions. [2018-12-02 01:38:11,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 01:38:11,275 INFO L276 IsEmpty]: Start isEmpty. Operand 27833 states and 35248 transitions. [2018-12-02 01:38:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-12-02 01:38:11,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:38:11,278 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:38:11,278 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:38:11,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:38:11,278 INFO L82 PathProgramCache]: Analyzing trace with hash 598484482, now seen corresponding path program 1 times [2018-12-02 01:38:11,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:38:11,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:38:11,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:38:11,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:38:11,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:38:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:38:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:38:11,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:38:11,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:38:11,458 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-12-02 01:38:11,458 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [869], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 01:38:11,460 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:38:11,460 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:38:11,705 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:38:11,705 INFO L272 AbstractInterpreter]: Visited 156 different actions 463 times. Merged at 6 different actions 17 times. Never widened. Performed 6379 root evaluator evaluations with a maximum evaluation depth of 13. Performed 6379 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-02 01:38:11,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:38:11,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:38:11,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:38:11,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:38:11,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:38:11,715 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:38:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:38:11,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:38:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:38:11,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:38:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 11 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:38:12,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:38:12,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2018-12-02 01:38:12,228 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:38:12,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 01:38:12,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 01:38:12,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-12-02 01:38:12,229 INFO L87 Difference]: Start difference. First operand 27833 states and 35248 transitions. Second operand 13 states. [2018-12-02 01:38:16,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:38:16,785 INFO L93 Difference]: Finished difference Result 55807 states and 83258 transitions. [2018-12-02 01:38:16,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-02 01:38:16,786 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 253 [2018-12-02 01:38:16,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:38:16,888 INFO L225 Difference]: With dead ends: 55807 [2018-12-02 01:38:16,888 INFO L226 Difference]: Without dead ends: 30862 [2018-12-02 01:38:16,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 523 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=904, Invalid=4066, Unknown=0, NotChecked=0, Total=4970 [2018-12-02 01:38:16,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30862 states. [2018-12-02 01:38:17,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30862 to 27487. [2018-12-02 01:38:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27487 states. [2018-12-02 01:38:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27487 states to 27487 states and 34413 transitions. [2018-12-02 01:38:17,483 INFO L78 Accepts]: Start accepts. Automaton has 27487 states and 34413 transitions. Word has length 253 [2018-12-02 01:38:17,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:38:17,484 INFO L480 AbstractCegarLoop]: Abstraction has 27487 states and 34413 transitions. [2018-12-02 01:38:17,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 01:38:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 27487 states and 34413 transitions. [2018-12-02 01:38:17,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-12-02 01:38:17,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:38:17,488 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:38:17,488 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:38:17,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:38:17,488 INFO L82 PathProgramCache]: Analyzing trace with hash -906141529, now seen corresponding path program 1 times [2018-12-02 01:38:17,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:38:17,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:38:17,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:38:17,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:38:17,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:38:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:38:17,721 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 200 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:38:17,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:38:17,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:38:17,721 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 312 with the following transitions: [2018-12-02 01:38:17,722 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [574], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 01:38:17,723 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:38:17,724 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:38:18,020 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:38:18,021 INFO L272 AbstractInterpreter]: Visited 126 different actions 374 times. Merged at 7 different actions 18 times. Never widened. Performed 4923 root evaluator evaluations with a maximum evaluation depth of 16. Performed 4923 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 5 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-02 01:38:18,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:38:18,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:38:18,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:38:18,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:38:18,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:38:18,028 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:38:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:38:18,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:38:18,223 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 199 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 01:38:18,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:38:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 199 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 01:38:18,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:38:18,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-12-02 01:38:18,505 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:38:18,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 01:38:18,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 01:38:18,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-12-02 01:38:18,505 INFO L87 Difference]: Start difference. First operand 27487 states and 34413 transitions. Second operand 14 states. [2018-12-02 01:38:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:38:23,414 INFO L93 Difference]: Finished difference Result 54331 states and 69092 transitions. [2018-12-02 01:38:23,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-02 01:38:23,414 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 311 [2018-12-02 01:38:23,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:38:23,458 INFO L225 Difference]: With dead ends: 54331 [2018-12-02 01:38:23,458 INFO L226 Difference]: Without dead ends: 27228 [2018-12-02 01:38:23,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 661 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1658 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=951, Invalid=4451, Unknown=0, NotChecked=0, Total=5402 [2018-12-02 01:38:23,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27228 states. [2018-12-02 01:38:23,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27228 to 20277. [2018-12-02 01:38:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20277 states. [2018-12-02 01:38:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20277 states to 20277 states and 24485 transitions. [2018-12-02 01:38:23,791 INFO L78 Accepts]: Start accepts. Automaton has 20277 states and 24485 transitions. Word has length 311 [2018-12-02 01:38:23,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:38:23,791 INFO L480 AbstractCegarLoop]: Abstraction has 20277 states and 24485 transitions. [2018-12-02 01:38:23,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 01:38:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 20277 states and 24485 transitions. [2018-12-02 01:38:23,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-12-02 01:38:23,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:38:23,795 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:38:23,795 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:38:23,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:38:23,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2093022954, now seen corresponding path program 1 times [2018-12-02 01:38:23,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:38:23,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:38:23,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:38:23,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:38:23,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:38:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:38:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 27 proven. 251 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 01:38:24,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:38:24,113 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:38:24,114 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 319 with the following transitions: [2018-12-02 01:38:24,114 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 01:38:24,116 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:38:24,116 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:38:24,421 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:38:24,421 INFO L272 AbstractInterpreter]: Visited 136 different actions 539 times. Merged at 7 different actions 27 times. Never widened. Performed 7440 root evaluator evaluations with a maximum evaluation depth of 14. Performed 7440 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Found 7 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-02 01:38:24,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:38:24,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:38:24,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:38:24,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:38:24,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:38:24,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:38:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:38:24,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:38:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 196 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-02 01:38:24,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:38:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 196 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-02 01:38:24,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:38:24,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 18 [2018-12-02 01:38:24,883 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:38:24,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 01:38:24,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 01:38:24,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-12-02 01:38:24,884 INFO L87 Difference]: Start difference. First operand 20277 states and 24485 transitions. Second operand 16 states. [2018-12-02 01:38:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:38:32,793 INFO L93 Difference]: Finished difference Result 40675 states and 52011 transitions. [2018-12-02 01:38:32,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-02 01:38:32,794 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 318 [2018-12-02 01:38:32,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:38:32,849 INFO L225 Difference]: With dead ends: 40675 [2018-12-02 01:38:32,849 INFO L226 Difference]: Without dead ends: 22914 [2018-12-02 01:38:32,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 682 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1608 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=965, Invalid=4291, Unknown=0, NotChecked=0, Total=5256 [2018-12-02 01:38:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22914 states. [2018-12-02 01:38:33,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22914 to 21516. [2018-12-02 01:38:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21516 states. [2018-12-02 01:38:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21516 states to 21516 states and 25907 transitions. [2018-12-02 01:38:33,222 INFO L78 Accepts]: Start accepts. Automaton has 21516 states and 25907 transitions. Word has length 318 [2018-12-02 01:38:33,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:38:33,222 INFO L480 AbstractCegarLoop]: Abstraction has 21516 states and 25907 transitions. [2018-12-02 01:38:33,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 01:38:33,222 INFO L276 IsEmpty]: Start isEmpty. Operand 21516 states and 25907 transitions. [2018-12-02 01:38:33,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-12-02 01:38:33,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:38:33,225 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:38:33,225 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:38:33,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:38:33,225 INFO L82 PathProgramCache]: Analyzing trace with hash 12731746, now seen corresponding path program 1 times [2018-12-02 01:38:33,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:38:33,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:38:33,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:38:33,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:38:33,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:38:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:38:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-12-02 01:38:33,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:38:33,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:38:33,366 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 319 with the following transitions: [2018-12-02 01:38:33,366 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [870], [874], [878], [889], [893], [897], [901], [905], [909], [913], [924], [928], [932], [936], [940], [944], [948], [952], [956], [960], [971], [975], [979], [983], [987], [991], [994], [999], [1001], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 01:38:33,368 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:38:33,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:38:33,665 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:38:33,666 INFO L272 AbstractInterpreter]: Visited 186 different actions 731 times. Merged at 6 different actions 20 times. Never widened. Performed 10722 root evaluator evaluations with a maximum evaluation depth of 9. Performed 10722 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 4 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-02 01:38:33,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:38:33,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:38:33,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:38:33,669 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:38:33,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:38:33,675 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:38:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:38:33,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:38:34,633 WARN L180 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2018-12-02 01:38:34,696 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-12-02 01:38:34,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:38:34,841 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:34,872 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:34,902 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:34,934 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:34,965 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:34,997 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,026 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,055 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,086 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,123 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,154 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,185 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,215 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,245 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,274 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,302 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,331 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,360 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,391 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,420 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,450 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,480 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,510 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,545 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,576 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,615 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,646 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,678 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,711 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,742 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,776 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,809 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,839 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,871 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,902 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,932 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,963 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:35,992 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,023 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,056 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,085 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,119 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,157 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,191 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,222 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,257 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,285 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,317 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,350 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,380 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,415 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,444 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,476 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,506 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,536 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,568 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,599 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,631 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,661 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,694 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,729 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,759 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,794 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,830 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,863 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,895 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,926 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:36,958 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,024 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,056 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,082 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,110 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,139 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,169 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,197 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,225 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,251 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,278 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,306 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,334 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,365 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,397 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,427 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,455 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,487 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,518 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,548 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,576 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,606 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,636 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,674 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,703 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,732 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,762 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,791 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,817 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,844 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,873 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,908 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,935 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,965 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:37,994 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,024 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,053 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,082 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,111 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,141 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,171 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,197 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,225 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,256 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,285 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,317 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,347 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,374 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,402 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,436 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,467 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,497 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,525 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,556 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,584 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,614 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,645 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,675 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,710 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,741 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,772 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,803 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,832 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,871 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,906 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,947 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:38,981 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,009 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,037 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,065 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,094 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,123 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,155 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,188 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,217 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,247 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,277 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,307 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,340 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,370 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,401 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,433 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,467 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,496 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,523 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,553 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,583 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,611 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,640 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,669 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,698 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,725 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,754 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,782 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,815 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,850 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,883 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,915 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,947 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:39,980 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 01:38:40,737 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 13 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:38:40,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:38:40,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2018-12-02 01:38:40,753 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:38:40,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 01:38:40,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 01:38:40,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-12-02 01:38:40,754 INFO L87 Difference]: Start difference. First operand 21516 states and 25907 transitions. Second operand 14 states. [2018-12-02 01:38:42,846 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-02 01:38:48,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:38:48,782 INFO L93 Difference]: Finished difference Result 58928 states and 78244 transitions. [2018-12-02 01:38:48,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-02 01:38:48,783 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 318 [2018-12-02 01:38:48,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:38:48,852 INFO L225 Difference]: With dead ends: 58928 [2018-12-02 01:38:48,852 INFO L226 Difference]: Without dead ends: 39548 [2018-12-02 01:38:48,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 459 SyntacticMatches, 169 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1798 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=568, Invalid=1594, Unknown=0, NotChecked=0, Total=2162 [2018-12-02 01:38:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39548 states. [2018-12-02 01:38:49,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39548 to 34987. [2018-12-02 01:38:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34987 states. [2018-12-02 01:38:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34987 states to 34987 states and 42047 transitions. [2018-12-02 01:38:49,443 INFO L78 Accepts]: Start accepts. Automaton has 34987 states and 42047 transitions. Word has length 318 [2018-12-02 01:38:49,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:38:49,444 INFO L480 AbstractCegarLoop]: Abstraction has 34987 states and 42047 transitions. [2018-12-02 01:38:49,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 01:38:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 34987 states and 42047 transitions. [2018-12-02 01:38:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-12-02 01:38:49,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:38:49,448 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:38:49,448 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:38:49,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:38:49,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1779374113, now seen corresponding path program 1 times [2018-12-02 01:38:49,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:38:49,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:38:49,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:38:49,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:38:49,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:38:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:38:49,519 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-12-02 01:38:49,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:38:49,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:38:49,519 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:38:49,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:38:49,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:38:49,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:38:49,520 INFO L87 Difference]: Start difference. First operand 34987 states and 42047 transitions. Second operand 3 states. [2018-12-02 01:38:50,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:38:50,294 INFO L93 Difference]: Finished difference Result 70751 states and 85221 transitions. [2018-12-02 01:38:50,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:38:50,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2018-12-02 01:38:50,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:38:50,349 INFO L225 Difference]: With dead ends: 70751 [2018-12-02 01:38:50,349 INFO L226 Difference]: Without dead ends: 39312 [2018-12-02 01:38:50,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:38:50,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39312 states. [2018-12-02 01:38:50,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39312 to 35928. [2018-12-02 01:38:50,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35928 states. [2018-12-02 01:38:50,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35928 states to 35928 states and 43194 transitions. [2018-12-02 01:38:50,937 INFO L78 Accepts]: Start accepts. Automaton has 35928 states and 43194 transitions. Word has length 329 [2018-12-02 01:38:50,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:38:50,938 INFO L480 AbstractCegarLoop]: Abstraction has 35928 states and 43194 transitions. [2018-12-02 01:38:50,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:38:50,938 INFO L276 IsEmpty]: Start isEmpty. Operand 35928 states and 43194 transitions. [2018-12-02 01:38:50,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-12-02 01:38:50,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:38:50,941 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:38:50,941 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:38:50,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:38:50,941 INFO L82 PathProgramCache]: Analyzing trace with hash -92928221, now seen corresponding path program 1 times [2018-12-02 01:38:50,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:38:50,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:38:50,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:38:50,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:38:50,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:38:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:38:51,461 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 28 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:38:51,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:38:51,461 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:38:51,461 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 334 with the following transitions: [2018-12-02 01:38:51,461 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [629], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 01:38:51,463 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:38:51,463 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:38:51,905 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:38:51,905 INFO L272 AbstractInterpreter]: Visited 136 different actions 538 times. Merged at 7 different actions 26 times. Never widened. Performed 7284 root evaluator evaluations with a maximum evaluation depth of 16. Performed 7284 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 7 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-02 01:38:51,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:38:51,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:38:51,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:38:51,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:38:51,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:38:51,912 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:38:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:38:51,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:38:58,839 WARN L180 SmtUtils]: Spent 4.78 s on a formula simplification. DAG size of input: 151 DAG size of output: 24 [2018-12-02 01:39:00,183 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 17 proven. 189 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-12-02 01:39:00,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:39:00,570 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 204 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-12-02 01:39:00,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:39:00,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 5] total 24 [2018-12-02 01:39:00,586 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:39:00,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 01:39:00,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 01:39:00,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=464, Unknown=2, NotChecked=0, Total=552 [2018-12-02 01:39:00,586 INFO L87 Difference]: Start difference. First operand 35928 states and 43194 transitions. Second operand 22 states. [2018-12-02 01:39:03,988 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-12-02 01:39:05,246 WARN L180 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-12-02 01:39:27,498 WARN L180 SmtUtils]: Spent 3.19 s on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2018-12-02 01:39:47,056 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2018-12-02 01:40:27,812 WARN L180 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-12-02 01:40:43,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:40:43,833 INFO L93 Difference]: Finished difference Result 78713 states and 96271 transitions. [2018-12-02 01:40:43,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-02 01:40:43,833 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 333 [2018-12-02 01:40:43,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:40:43,898 INFO L225 Difference]: With dead ends: 78713 [2018-12-02 01:40:43,898 INFO L226 Difference]: Without dead ends: 42342 [2018-12-02 01:40:43,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 658 SyntacticMatches, 3 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=1546, Invalid=9784, Unknown=12, NotChecked=0, Total=11342 [2018-12-02 01:40:43,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42342 states. [2018-12-02 01:40:44,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42342 to 41272. [2018-12-02 01:40:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41272 states. [2018-12-02 01:40:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41272 states to 41272 states and 48030 transitions. [2018-12-02 01:40:44,494 INFO L78 Accepts]: Start accepts. Automaton has 41272 states and 48030 transitions. Word has length 333 [2018-12-02 01:40:44,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:40:44,494 INFO L480 AbstractCegarLoop]: Abstraction has 41272 states and 48030 transitions. [2018-12-02 01:40:44,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 01:40:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand 41272 states and 48030 transitions. [2018-12-02 01:40:44,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-12-02 01:40:44,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:40:44,498 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:40:44,498 INFO L423 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:40:44,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:40:44,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1621015123, now seen corresponding path program 1 times [2018-12-02 01:40:44,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:40:44,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:40:44,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:40:44,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:40:44,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:40:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:40:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 23 proven. 182 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 01:40:44,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:40:44,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:40:44,665 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 340 with the following transitions: [2018-12-02 01:40:44,665 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [633], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 01:40:44,667 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:40:44,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:40:44,937 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:40:44,937 INFO L272 AbstractInterpreter]: Visited 141 different actions 559 times. Merged at 7 different actions 26 times. Never widened. Performed 7849 root evaluator evaluations with a maximum evaluation depth of 13. Performed 7849 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 7 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-02 01:40:44,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:40:44,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:40:44,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:40:44,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:40:44,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:40:44,944 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:40:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:40:44,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:40:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 201 proven. 2 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-12-02 01:40:47,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:40:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 119 proven. 94 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-02 01:40:47,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:40:47,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 11 [2018-12-02 01:40:47,765 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:40:47,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 01:40:47,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 01:40:47,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=74, Unknown=2, NotChecked=0, Total=110 [2018-12-02 01:40:47,765 INFO L87 Difference]: Start difference. First operand 41272 states and 48030 transitions. Second operand 9 states. [2018-12-02 01:40:51,165 WARN L180 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2018-12-02 01:41:16,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:41:16,342 INFO L93 Difference]: Finished difference Result 86372 states and 101699 transitions. [2018-12-02 01:41:16,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 01:41:16,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 339 [2018-12-02 01:41:16,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:41:16,407 INFO L225 Difference]: With dead ends: 86372 [2018-12-02 01:41:16,407 INFO L226 Difference]: Without dead ends: 48420 [2018-12-02 01:41:16,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 686 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=159, Invalid=391, Unknown=2, NotChecked=0, Total=552 [2018-12-02 01:41:16,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48420 states. [2018-12-02 01:41:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48420 to 46990. [2018-12-02 01:41:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46990 states. [2018-12-02 01:41:17,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46990 states to 46990 states and 53627 transitions. [2018-12-02 01:41:17,045 INFO L78 Accepts]: Start accepts. Automaton has 46990 states and 53627 transitions. Word has length 339 [2018-12-02 01:41:17,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:41:17,045 INFO L480 AbstractCegarLoop]: Abstraction has 46990 states and 53627 transitions. [2018-12-02 01:41:17,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 01:41:17,046 INFO L276 IsEmpty]: Start isEmpty. Operand 46990 states and 53627 transitions. [2018-12-02 01:41:17,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-12-02 01:41:17,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:41:17,049 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:41:17,049 INFO L423 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:41:17,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:41:17,049 INFO L82 PathProgramCache]: Analyzing trace with hash 331295927, now seen corresponding path program 1 times [2018-12-02 01:41:17,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:41:17,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:41:17,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:41:17,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:41:17,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:41:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:41:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 28 proven. 178 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-12-02 01:41:17,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:41:17,343 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:41:17,344 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 354 with the following transitions: [2018-12-02 01:41:17,344 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [784], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 01:41:17,345 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:41:17,345 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:41:17,704 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:41:17,704 INFO L272 AbstractInterpreter]: Visited 141 different actions 561 times. Merged at 7 different actions 29 times. Widened at 1 different actions 1 times. Performed 7689 root evaluator evaluations with a maximum evaluation depth of 16. Performed 7689 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 7 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-02 01:41:17,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:41:17,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:41:17,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:41:17,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:41:17,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:41:17,712 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:41:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:41:17,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:41:17,942 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 202 proven. 4 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-12-02 01:41:17,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:41:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 17 proven. 189 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-12-02 01:41:18,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:41:18,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2018-12-02 01:41:18,341 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:41:18,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 01:41:18,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 01:41:18,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-12-02 01:41:18,341 INFO L87 Difference]: Start difference. First operand 46990 states and 53627 transitions. Second operand 16 states. [2018-12-02 01:41:23,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:41:23,898 INFO L93 Difference]: Finished difference Result 91857 states and 108936 transitions. [2018-12-02 01:41:23,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-02 01:41:23,899 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 353 [2018-12-02 01:41:23,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:41:23,979 INFO L225 Difference]: With dead ends: 91857 [2018-12-02 01:41:23,980 INFO L226 Difference]: Without dead ends: 48983 [2018-12-02 01:41:24,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 698 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=759, Invalid=2663, Unknown=0, NotChecked=0, Total=3422 [2018-12-02 01:41:24,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48983 states. [2018-12-02 01:41:24,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48983 to 46990. [2018-12-02 01:41:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46990 states. [2018-12-02 01:41:24,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46990 states to 46990 states and 53571 transitions. [2018-12-02 01:41:24,692 INFO L78 Accepts]: Start accepts. Automaton has 46990 states and 53571 transitions. Word has length 353 [2018-12-02 01:41:24,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:41:24,692 INFO L480 AbstractCegarLoop]: Abstraction has 46990 states and 53571 transitions. [2018-12-02 01:41:24,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 01:41:24,692 INFO L276 IsEmpty]: Start isEmpty. Operand 46990 states and 53571 transitions. [2018-12-02 01:41:24,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-12-02 01:41:24,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:41:24,696 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:41:24,696 INFO L423 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:41:24,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:41:24,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1424384412, now seen corresponding path program 1 times [2018-12-02 01:41:24,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:41:24,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:41:24,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:41:24,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:41:24,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:41:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:41:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 231 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:41:25,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:41:25,107 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:41:25,107 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 376 with the following transitions: [2018-12-02 01:41:25,107 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [777], [781], [785], [789], [793], [797], [808], [812], [816], [819], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 01:41:25,108 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:41:25,108 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:41:25,449 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:41:25,449 INFO L272 AbstractInterpreter]: Visited 150 different actions 595 times. Merged at 7 different actions 26 times. Never widened. Performed 8444 root evaluator evaluations with a maximum evaluation depth of 13. Performed 8444 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 7 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-02 01:41:25,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:41:25,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:41:25,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:41:25,451 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:41:25,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:41:25,457 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:41:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:41:25,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:41:26,635 WARN L180 SmtUtils]: Spent 977.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 45 [2018-12-02 01:41:26,883 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 143 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:41:26,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:41:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 231 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:41:27,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:41:27,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 32 [2018-12-02 01:41:27,581 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:41:27,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-02 01:41:27,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-02 01:41:27,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2018-12-02 01:41:27,582 INFO L87 Difference]: Start difference. First operand 46990 states and 53571 transitions. Second operand 25 states. [2018-12-02 01:41:28,996 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-12-02 01:41:32,507 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2018-12-02 01:41:32,947 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2018-12-02 01:41:35,670 WARN L180 SmtUtils]: Spent 922.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2018-12-02 01:41:37,186 WARN L180 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2018-12-02 01:41:40,609 WARN L180 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2018-12-02 01:41:41,824 WARN L180 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2018-12-02 01:41:46,852 WARN L180 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-12-02 01:41:47,920 WARN L180 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2018-12-02 01:41:51,759 WARN L180 SmtUtils]: Spent 894.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2018-12-02 01:41:52,642 WARN L180 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2018-12-02 01:41:55,665 WARN L180 SmtUtils]: Spent 909.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2018-12-02 01:42:00,235 WARN L180 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2018-12-02 01:42:01,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:42:01,137 INFO L93 Difference]: Finished difference Result 92765 states and 110316 transitions. [2018-12-02 01:42:01,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-12-02 01:42:01,138 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 375 [2018-12-02 01:42:01,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:42:01,232 INFO L225 Difference]: With dead ends: 92765 [2018-12-02 01:42:01,232 INFO L226 Difference]: Without dead ends: 49671 [2018-12-02 01:42:01,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 747 SyntacticMatches, 3 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10095 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=4351, Invalid=23039, Unknown=0, NotChecked=0, Total=27390 [2018-12-02 01:42:01,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49671 states. [2018-12-02 01:42:01,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49671 to 47418. [2018-12-02 01:42:01,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47418 states. [2018-12-02 01:42:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47418 states to 47418 states and 53919 transitions. [2018-12-02 01:42:01,978 INFO L78 Accepts]: Start accepts. Automaton has 47418 states and 53919 transitions. Word has length 375 [2018-12-02 01:42:01,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:42:01,979 INFO L480 AbstractCegarLoop]: Abstraction has 47418 states and 53919 transitions. [2018-12-02 01:42:01,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-02 01:42:01,979 INFO L276 IsEmpty]: Start isEmpty. Operand 47418 states and 53919 transitions. [2018-12-02 01:42:01,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-12-02 01:42:01,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:42:01,983 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:42:01,983 INFO L423 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:42:01,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:42:01,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1038295940, now seen corresponding path program 1 times [2018-12-02 01:42:01,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:42:01,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:01,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:42:01,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:01,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:42:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:42:02,127 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 200 proven. 87 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-02 01:42:02,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:42:02,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:42:02,127 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 394 with the following transitions: [2018-12-02 01:42:02,127 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 01:42:02,128 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:42:02,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:42:02,506 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:42:02,506 INFO L272 AbstractInterpreter]: Visited 127 different actions 508 times. Merged at 8 different actions 32 times. Never widened. Performed 6854 root evaluator evaluations with a maximum evaluation depth of 16. Performed 6854 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 10 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-02 01:42:02,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:42:02,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:42:02,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:42:02,508 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:42:02,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:42:02,515 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:42:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:42:02,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:42:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 289 proven. 2 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-12-02 01:42:02,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:42:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 289 proven. 2 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-12-02 01:42:02,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:42:02,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-12-02 01:42:02,841 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:42:02,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 01:42:02,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 01:42:02,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-02 01:42:02,841 INFO L87 Difference]: Start difference. First operand 47418 states and 53919 transitions. Second operand 9 states. [2018-12-02 01:42:08,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:42:08,603 INFO L93 Difference]: Finished difference Result 110485 states and 126568 transitions. [2018-12-02 01:42:08,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-02 01:42:08,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 393 [2018-12-02 01:42:08,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:42:08,691 INFO L225 Difference]: With dead ends: 110485 [2018-12-02 01:42:08,691 INFO L226 Difference]: Without dead ends: 61897 [2018-12-02 01:42:08,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 847 GetRequests, 810 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=1167, Unknown=0, NotChecked=0, Total=1482 [2018-12-02 01:42:08,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61897 states. [2018-12-02 01:42:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61897 to 51080. [2018-12-02 01:42:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51080 states. [2018-12-02 01:42:09,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51080 states to 51080 states and 56997 transitions. [2018-12-02 01:42:09,521 INFO L78 Accepts]: Start accepts. Automaton has 51080 states and 56997 transitions. Word has length 393 [2018-12-02 01:42:09,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:42:09,522 INFO L480 AbstractCegarLoop]: Abstraction has 51080 states and 56997 transitions. [2018-12-02 01:42:09,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 01:42:09,522 INFO L276 IsEmpty]: Start isEmpty. Operand 51080 states and 56997 transitions. [2018-12-02 01:42:09,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-12-02 01:42:09,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:42:09,527 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:42:09,527 INFO L423 AbstractCegarLoop]: === Iteration 23 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:42:09,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:42:09,528 INFO L82 PathProgramCache]: Analyzing trace with hash -480737097, now seen corresponding path program 1 times [2018-12-02 01:42:09,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:42:09,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:09,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:42:09,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:09,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:42:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:42:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2018-12-02 01:42:09,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:42:09,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:42:09,678 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:42:09,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:42:09,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:42:09,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:42:09,679 INFO L87 Difference]: Start difference. First operand 51080 states and 56997 transitions. Second operand 3 states. [2018-12-02 01:42:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:42:10,747 INFO L93 Difference]: Finished difference Result 102062 states and 114194 transitions. [2018-12-02 01:42:10,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:42:10,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 419 [2018-12-02 01:42:10,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:42:10,815 INFO L225 Difference]: With dead ends: 102062 [2018-12-02 01:42:10,815 INFO L226 Difference]: Without dead ends: 54866 [2018-12-02 01:42:10,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:42:10,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54866 states. [2018-12-02 01:42:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54866 to 51476. [2018-12-02 01:42:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51476 states. [2018-12-02 01:42:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51476 states to 51476 states and 57397 transitions. [2018-12-02 01:42:11,569 INFO L78 Accepts]: Start accepts. Automaton has 51476 states and 57397 transitions. Word has length 419 [2018-12-02 01:42:11,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:42:11,569 INFO L480 AbstractCegarLoop]: Abstraction has 51476 states and 57397 transitions. [2018-12-02 01:42:11,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:42:11,569 INFO L276 IsEmpty]: Start isEmpty. Operand 51476 states and 57397 transitions. [2018-12-02 01:42:11,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-12-02 01:42:11,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:42:11,575 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:42:11,575 INFO L423 AbstractCegarLoop]: === Iteration 24 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:42:11,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:42:11,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2064294615, now seen corresponding path program 1 times [2018-12-02 01:42:11,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:42:11,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:11,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:42:11,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:42:11,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:42:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:42:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 165 proven. 183 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 01:42:11,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:42:11,868 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:42:11,869 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 420 with the following transitions: [2018-12-02 01:42:11,869 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [7], [10], [18], [26], [34], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [869], [870], [874], [878], [889], [893], [897], [901], [905], [909], [913], [924], [928], [932], [936], [940], [944], [948], [952], [956], [959], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-02 01:42:11,871 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:42:11,871 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:42:17,866 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:42:17,866 INFO L272 AbstractInterpreter]: Visited 176 different actions 524 times. Merged at 7 different actions 18 times. Never widened. Performed 7374 root evaluator evaluations with a maximum evaluation depth of 23. Performed 7374 inverse root evaluator evaluations with a maximum inverse evaluation depth of 23. Found 5 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-02 01:42:17,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:42:17,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:42:17,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:42:17,869 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:42:17,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:42:17,876 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:42:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:42:17,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:42:25,709 WARN L180 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 37 DAG size of output: 15 [2018-12-02 01:42:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 109 proven. 241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:42:27,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:42:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 252 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:42:28,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:42:28,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 25 [2018-12-02 01:42:28,467 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:42:28,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 01:42:28,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 01:42:28,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=498, Unknown=4, NotChecked=0, Total=600 [2018-12-02 01:42:28,467 INFO L87 Difference]: Start difference. First operand 51476 states and 57397 transitions. Second operand 20 states. [2018-12-02 01:42:33,445 WARN L180 SmtUtils]: Spent 906.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-12-02 01:42:34,699 WARN L180 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-12-02 01:42:35,769 WARN L180 SmtUtils]: Spent 927.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-02 01:42:36,096 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-12-02 01:43:10,290 WARN L180 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-12-02 01:43:20,719 WARN L180 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-02 01:43:24,977 WARN L180 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-12-02 01:43:30,875 WARN L180 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-02 01:43:38,311 WARN L180 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-12-02 01:44:50,358 WARN L180 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-12-02 01:46:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:13,374 INFO L93 Difference]: Finished difference Result 105683 states and 121369 transitions. [2018-12-02 01:46:13,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-02 01:46:13,374 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 419 [2018-12-02 01:46:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:13,470 INFO L225 Difference]: With dead ends: 105683 [2018-12-02 01:46:13,471 INFO L226 Difference]: Without dead ends: 57901 [2018-12-02 01:46:13,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 934 GetRequests, 825 SyntacticMatches, 5 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3648 ImplicationChecksByTransitivity, 65.2s TimeCoverageRelationStatistics Valid=1854, Invalid=9247, Unknown=29, NotChecked=0, Total=11130 [2018-12-02 01:46:13,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57901 states. [2018-12-02 01:46:14,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57901 to 54347. [2018-12-02 01:46:14,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54347 states. [2018-12-02 01:46:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54347 states to 54347 states and 60422 transitions. [2018-12-02 01:46:14,430 INFO L78 Accepts]: Start accepts. Automaton has 54347 states and 60422 transitions. Word has length 419 [2018-12-02 01:46:14,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:14,430 INFO L480 AbstractCegarLoop]: Abstraction has 54347 states and 60422 transitions. [2018-12-02 01:46:14,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 01:46:14,430 INFO L276 IsEmpty]: Start isEmpty. Operand 54347 states and 60422 transitions. [2018-12-02 01:46:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-12-02 01:46:14,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:14,437 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:46:14,437 INFO L423 AbstractCegarLoop]: === Iteration 25 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:14,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:14,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1636159661, now seen corresponding path program 1 times [2018-12-02 01:46:14,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:14,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:14,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:14,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:14,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:46:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:46:14,565 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 01:46:14,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:46:14 BoogieIcfgContainer [2018-12-02 01:46:14,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 01:46:14,658 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 01:46:14,658 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 01:46:14,658 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 01:46:14,659 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:35:01" (3/4) ... [2018-12-02 01:46:14,660 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 01:46:14,755 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d70dfde7-dd7c-4a76-9f6d-2ddec40bce1b/bin-2019/utaipan/witness.graphml [2018-12-02 01:46:14,755 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 01:46:14,756 INFO L168 Benchmark]: Toolchain (without parser) took 674871.41 ms. Allocated memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: 2.5 GB). Free memory was 941.6 MB in the beginning and 1.8 GB in the end (delta: -842.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-12-02 01:46:14,756 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:46:14,756 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. [2018-12-02 01:46:14,756 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-02 01:46:14,757 INFO L168 Benchmark]: Boogie Preprocessor took 61.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. [2018-12-02 01:46:14,757 INFO L168 Benchmark]: RCFGBuilder took 949.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 929.8 MB in the end (delta: 167.1 MB). Peak memory consumption was 167.1 MB. Max. memory is 11.5 GB. [2018-12-02 01:46:14,757 INFO L168 Benchmark]: TraceAbstraction took 673291.32 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 929.8 MB in the beginning and 1.8 GB in the end (delta: -902.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-02 01:46:14,757 INFO L168 Benchmark]: Witness Printer took 97.02 ms. Allocated memory is still 3.5 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. [2018-12-02 01:46:14,758 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 439.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 949.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 929.8 MB in the end (delta: 167.1 MB). Peak memory consumption was 167.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 673291.32 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 929.8 MB in the beginning and 1.8 GB in the end (delta: -902.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 97.02 ms. Allocated memory is still 3.5 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 24]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputA = 1; [L8] int inputD = 4; [L9] int inputB = 2; [L10] int inputE = 5; [L11] int inputF = 6; [L12] int inputC = 3; [L15] int a29 = 130; [L16] int a4 = 1; [L17] int a23 = 312; [L18] int a8 = 15; [L19] int a25 = 10; [L20] int a3 = 1; VAL [\old(a23)=206683, \old(a25)=206687, \old(a29)=206685, \old(a3)=206684, \old(a4)=206679, \old(a8)=206686, \old(inputA)=206681, \old(inputB)=206682, \old(inputC)=206680, \old(inputD)=206677, \old(inputE)=206676, \old(inputF)=206678, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1031] int output = -1; VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L1042] CALL, EXPR calculate_output(input) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L240] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L247] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L280] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L294] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L299] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L305] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L310] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L334] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L353] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L358] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L384] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L391] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L411] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L417] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L422] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L450] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L456] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L463] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L526] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L531] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L537] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L542] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L549] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L555] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L561] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L566] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L572] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L575] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L581] COND FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L586] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && ((a3==1) && (!(a4==1) && ((input == 4) && (((a25==10) && ((140 < a29) && (245 >= a29)) ) || (((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9)))))))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L598] COND FALSE !(((((a8==15) && ((!(a4==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 6))) && (a3==1))) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L603] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L615] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L621] COND FALSE !(((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L628] COND FALSE !(((((a8==15) && ( a23 <= -43 && (!(a4==1) && ((a25==11) && (input == 5))))) && (a3==1)) && ((245 < a29) && (277 >= a29)) )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L635] COND FALSE !((((((((input == 2) && ((a25==9) || (a25==10))) && (a8==15)) && ((140 < a29) && (245 >= a29)) ) && 306 < a23 ) && (a3==1)) && (a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L642] COND FALSE !(((a8==15) && (((( 277 < a29 && ((input == 2) && ((a25==11) || ((a25==9) || (a25==10))))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L647] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 3) && ((a25==12) || ((a25==10) || (a25==11))))) && !(a4==1)) && (a8==15)) && a29 <= 140 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L658] COND FALSE !((((!(a4==1) && ((((input == 6) && ((a25==12) || ((a25==10) || (a25==11)))) && (a8==15)) && ((-43 < a23) && (138 >= a23)) )) && (a3==1)) && a29 <= 140 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L663] COND FALSE !(((a25==9) && (( a29 <= 140 && ((a3==1) && (!(a4==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 2))))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L670] COND FALSE !((!(a4==1) && ( a23 <= -43 && (((a8==15) && (((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ( ((245 < a29) && (277 >= a29)) && (a25==13))) || ((a25==9) && 277 < a29 )) && (input == 3))) && (a3==1))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L675] COND FALSE !((((!(a4==1) && ((a3==1) && ((input == 5) && ((( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ((a25==9) && 277 < a29 ))))) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L681] COND FALSE !(( a23 <= -43 && (!(a4==1) && ( ((245 < a29) && (277 >= a29)) && ((a8==15) && ((a25==11) && ((a3==1) && (input == 3)))))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L688] COND FALSE !(((((a8==15) && ( 306 < a23 && ( ((140 < a29) && (245 >= a29)) && ((input == 1) && ((a25==9) || (a25==10)))))) && (a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L694] COND FALSE !((!(a4==1) && (((((a3==1) && ((input == 2) && (((a25==9) || (a25==10)) || (a25==11)))) && ((140 < a29) && (245 >= a29)) ) && a23 <= -43 ) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L706] COND FALSE !(((((((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))) && (input == 6)) && (a3==1)) && 306 < a23 ) && (a4==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L712] COND FALSE !(( 306 < a23 && ((a8==15) && ( 277 < a29 && ((a4==1) && ((a3==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 5)))))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L717] COND FALSE !(((( 277 < a29 && ((a8==15) && (((input == 6) && a23 <= -43 ) && (a25==13)))) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L731] COND FALSE !(((a3==1) && (((!(a4==1) && ((( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))) && (input == 3))) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L738] COND FALSE !(((a3==1) && (( 306 < a23 && (((a4==1) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 1))) && a29 <= 140 )) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L743] COND FALSE !((((( a23 <= -43 && ((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))))) && (a3==1)) && !(a4==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L750] COND FALSE !(((!(a4==1) && (((a8==15) && ( a29 <= 140 && (((a25==10) || (a25==11)) && (input == 5)))) && a23 <= -43 )) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L757] COND FALSE !((((((a8==15) && ((a3==1) && ( a23 <= -43 && (input == 5)))) && !(a4==1)) && (a25==13)) && 277 < a29 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L769] COND FALSE !(((a8==15) && ((a3==1) && ( 306 < a23 && ((((((a25==11) || (a25==12)) || (a25==13)) && (input == 1)) && (a4==1)) && ((245 < a29) && (277 >= a29)) ))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L774] COND FALSE !((!(a4==1) && (((((((a25==12) || (a25==13)) && (input == 6)) && (a8==15)) && a23 <= -43 ) && (a3==1)) && a29 <= 140 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L780] COND FALSE !(((a3==1) && (( a23 <= -43 && (((input == 6) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && !(a4==1))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L787] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 6)) && (a25==9))) && a29 <= 140 ) && (a3==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L792] COND FALSE !((( a29 <= 140 && ((a3==1) && ((a8==15) && ((a25==13) && ( 306 < a23 && (input == 1)))))) && (a4==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L799] COND FALSE !(((a3==1) && (((a8==15) && (((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9)))) && (input == 5)) && 306 < a23 )) && (a4==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L804] COND FALSE !((((((a8==15) && ((input == 4) && (( 277 < a29 && (a25==9)) || (( ((245 < a29) && (277 >= a29)) && (a25==12)) || ( ((245 < a29) && (277 >= a29)) && (a25==13)))))) && !(a4==1)) && a23 <= -43 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L816] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (!(a4==1) && ((input == 5) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) )))))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L822] COND FALSE !(( a29 <= 140 && ((((( 306 < a23 && (input == 2)) && (a25==13)) && (a4==1)) && (a3==1)) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L825] COND FALSE !(((a8==15) && ((((a3==1) && ((((a25==10) || (a25==11)) && (input == 6)) && a29 <= 140 )) && a23 <= -43 ) && !(a4==1)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L831] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((a8==15) && (((a25==13) || ((a25==11) || (a25==12))) && (input == 4))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L836] COND FALSE !((((a3==1) && ((a8==15) && ((((a25==13) && (input == 4)) && (a4==1)) && a29 <= 140 ))) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !((( 306 < a23 && ((a25==13) && ((((input == 3) && a29 <= 140 ) && (a3==1)) && (a4==1)))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L846] COND FALSE !((!(a4==1) && (( 277 < a29 && ((((input == 4) && a23 <= -43 ) && (a8==15)) && (a3==1))) && (a25==13)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L852] COND FALSE !(((a3==1) && (((((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ) || (( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==12))) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13))))) && (input == 1)) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L859] COND FALSE !(( 277 < a29 && ((a3==1) && ((a8==15) && ((a4==1) && ( 306 < a23 && ((input == 6) && (((a25==9) || (a25==10)) || (a25==11))))))))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L865] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 4) && ((a25==12) || ((a25==10) || (a25==11))))) && (a8==15)) && !(a4==1)) && (a3==1)) && a29 <= 140 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L876] COND FALSE !(((((( a23 <= -43 && ((input == 5) && ((a25==12) || ((a25==10) || (a25==11))))) && (a3==1)) && !(a4==1)) && 277 < a29 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L881] COND FALSE !(((((a8==15) && ((a4==1) && (((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 2)))) && (a3==1)) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L886] COND FALSE !((( a23 <= -43 && ((( ((140 < a29) && (245 >= a29)) && ((input == 1) && (((a25==9) || (a25==10)) || (a25==11)))) && !(a4==1)) && (a8==15))) && (a3==1))) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=10, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L893] COND TRUE ((((a3==1) && ((((input == 2) && ((a25==12) || ((a25==10) || (a25==11)))) && (a4==1)) && (a8==15))) && a29 <= 140 ) && 306 < a23 ) [L895] a25 = 13 [L897] return 23; VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, \old(input)=2, \result=23, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1042] RET, EXPR calculate_output(input) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, calculate_output(input)=23, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L1042] output = calculate_output(input) [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=23] [L1042] CALL, EXPR calculate_output(input) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L240] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L247] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L280] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L294] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L299] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L305] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L310] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L334] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L353] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L358] COND FALSE !(((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(( 306 < a23 && ((a4==1) && (((((((a25==11) || (a25==12)) || (a25==13)) && (input == 3)) && (a8==15)) && (a3==1)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(( ((245 < a29) && (277 >= a29)) && (((((!(a4==1) && (input == 6)) && (a3==1)) && (a25==11)) && (a8==15)) && a23 <= -43 ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L377] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && (((a8==15) && ((input == 2) && ((( a29 <= 140 && (a25==13)) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ((a25==10) && ((140 < a29) && (245 >= a29)) )))) && (a3==1))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L384] COND FALSE !(( a29 <= 140 && ((a8==15) && ((((((a25==10) || (a25==11)) && (input == 3)) && a23 <= -43 ) && (a3==1)) && !(a4==1))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L391] COND FALSE !((((((a8==15) && (((input == 3) && (((a25==10) || (a25==11)) || (a25==12))) && (a3==1))) && a23 <= -43 ) && !(a4==1)) && 277 < a29 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((!(a4==1) && ((a25==9) && ((a8==15) && ((a3==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 1)))))) && a29 <= 140 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L411] COND FALSE !(((a8==15) && ((( 306 < a23 && (((((a25==11) || (a25==12)) || (a25==13)) && (input == 6)) && ((245 < a29) && (277 >= a29)) )) && (a4==1)) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L417] COND FALSE !((((((!(a4==1) && ((a8==15) && (input == 2))) && (a3==1)) && ((140 < a29) && (245 >= a29)) ) && (a25==12)) && a23 <= -43 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L422] COND FALSE !(( a23 <= -43 && (( a29 <= 140 && ((a8==15) && (!(a4==1) && (((a25==12) || (a25==13)) && (input == 3))))) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((((((input == 6) && ((((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9))) || ( ((140 < a29) && (245 >= a29)) && (a25==10)))) && (a8==15)) && (a3==1)) && !(a4==1)) && ((-43 < a23) && (138 >= a23)) )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !(((!(a4==1) && (((((a3==1) && (input == 4)) && (a25==11)) && ((245 < a29) && (277 >= a29)) ) && a23 <= -43 )) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L443] COND FALSE !(((a3==1) && ( ((140 < a29) && (245 >= a29)) && ( a23 <= -43 && ((a8==15) && (!(a4==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 3)))))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L450] COND FALSE !(((((!(a4==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 4)) && 277 < a29 )) && a23 <= -43 ) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L456] COND FALSE !(( ((140 < a29) && (245 >= a29)) && ((a8==15) && (((a25==12) && (!(a4==1) && ( a23 <= -43 && (input == 4)))) && (a3==1))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L463] COND FALSE !(((a3==1) && ((((((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || (((a25==9) && (!(a4==1) && a29 <= 140 )) && a23 <= -43 )) && (input == 2)) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((input == 5) && (((((a25==12) && ((a4==1) && 277 < a29 )) && 306 < a23 ) || ((( 277 < a29 && (a4==1)) && (a25==13)) && 306 < a23 )) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 ))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((a25==12) && (((a3==1) && ((((input == 1) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) ) && !(a4==1))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !((((a8==15) && (( ((-43 < a23) && (138 >= a23)) && ((input == 1) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (((a25==13) && a29 <= 140 ) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))))) && (a3==1))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !(((a3==1) && ((a8==15) && (((((( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 3)) && !(a4==1)) && a23 <= -43 )))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L507] COND FALSE !((( a29 <= 140 && ( ((-43 < a23) && (138 >= a23)) && ((a3==1) && ((a8==15) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 2)))))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==1) && ( 306 < a23 && ((((input == 3) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L526] COND FALSE !(((a4==1) && ((((a3==1) && ( 306 < a23 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 4)))) && a29 <= 140 ) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L531] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 5)) && (a3==1))) && (a25==9)) && a29 <= 140 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L537] COND FALSE !(( 306 < a23 && (((a8==15) && ((((input == 1) && ((a25==11) || (a25==12))) && (a4==1)) && (a3==1))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L542] COND FALSE !(((((a8==15) && ( a23 <= -43 && (((input == 1) && ((a25==10) || (a25==11))) && a29 <= 140 ))) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L549] COND FALSE !(((( a23 <= -43 && (!(a4==1) && ((a3==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 5))))) && (a8==15)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L555] COND FALSE !(((a3==1) && ( ((-43 < a23) && (138 >= a23)) && ((a8==15) && ((((((a25==10) || (a25==11)) || (a25==12)) && (input == 5)) && a29 <= 140 ) && !(a4==1)))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L561] COND FALSE !(( 306 < a23 && (((a3==1) && ( 277 < a29 && (((input == 4) && (((a25==9) || (a25==10)) || (a25==11))) && (a8==15)))) && (a4==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L566] COND FALSE !((!(a4==1) && ( a23 <= -43 && ((a8==15) && (((((a25==12) || ((a25==10) || (a25==11))) && (input == 1)) && (a3==1)) && 277 < a29 ))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L572] COND FALSE !(( 277 < a29 && (((a25==13) && ( a23 <= -43 && (!(a4==1) && ((input == 1) && (a3==1))))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L575] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (((a25==9) && ((input == 4) && !(a4==1))) && a29 <= 140 )) && (a3==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L581] COND FALSE !(((a8==15) && ((((a3==1) && (((((a25==10) || (a25==11)) || (a25==12)) && (input == 3)) && (a4==1))) && 306 < a23 ) && a29 <= 140 ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L586] COND FALSE !((( ((-43 < a23) && (138 >= a23)) && ((a3==1) && (!(a4==1) && ((input == 4) && (((a25==10) && ((140 < a29) && (245 >= a29)) ) || (((a25==13) && a29 <= 140 ) || ( ((140 < a29) && (245 >= a29)) && (a25==9)))))))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L598] COND FALSE !(((((a8==15) && ((!(a4==1) && (((a25==11) || ((a25==9) || (a25==10))) && (input == 6))) && (a3==1))) && a23 <= -43 ) && ((140 < a29) && (245 >= a29)) )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L603] COND FALSE !(( a29 <= 140 && (((a4==1) && ((a8==15) && (((input == 6) && (((a25==10) || (a25==11)) || (a25==12))) && 306 < a23 ))) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L615] COND FALSE !(((((((a3==1) && ((input == 5) && ((a25==11) || (a25==12)))) && (a4==1)) && 306 < a23 ) && ((140 < a29) && (245 >= a29)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L621] COND FALSE !(((((a4==1) && ( 306 < a23 && ((a8==15) && (((a25==11) || (a25==12)) && (input == 2))))) && ((140 < a29) && (245 >= a29)) ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L628] COND FALSE !(((((a8==15) && ( a23 <= -43 && (!(a4==1) && ((a25==11) && (input == 5))))) && (a3==1)) && ((245 < a29) && (277 >= a29)) )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L635] COND FALSE !((((((((input == 2) && ((a25==9) || (a25==10))) && (a8==15)) && ((140 < a29) && (245 >= a29)) ) && 306 < a23 ) && (a3==1)) && (a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L642] COND FALSE !(((a8==15) && (((( 277 < a29 && ((input == 2) && ((a25==11) || ((a25==9) || (a25==10))))) && (a4==1)) && (a3==1)) && 306 < a23 ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L647] COND FALSE !(((((( ((-43 < a23) && (138 >= a23)) && ((input == 3) && ((a25==12) || ((a25==10) || (a25==11))))) && !(a4==1)) && (a8==15)) && a29 <= 140 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L658] COND FALSE !((((!(a4==1) && ((((input == 6) && ((a25==12) || ((a25==10) || (a25==11)))) && (a8==15)) && ((-43 < a23) && (138 >= a23)) )) && (a3==1)) && a29 <= 140 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L663] COND FALSE !(((a25==9) && (( a29 <= 140 && ((a3==1) && (!(a4==1) && ( ((-43 < a23) && (138 >= a23)) && (input == 2))))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L670] COND FALSE !((!(a4==1) && ( a23 <= -43 && (((a8==15) && (((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ( ((245 < a29) && (277 >= a29)) && (a25==13))) || ((a25==9) && 277 < a29 )) && (input == 3))) && (a3==1))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L675] COND FALSE !((((!(a4==1) && ((a3==1) && ((input == 5) && ((( ((245 < a29) && (277 >= a29)) && (a25==12)) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ((a25==9) && 277 < a29 ))))) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L681] COND FALSE !(( a23 <= -43 && (!(a4==1) && ( ((245 < a29) && (277 >= a29)) && ((a8==15) && ((a25==11) && ((a3==1) && (input == 3)))))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L688] COND FALSE !(((((a8==15) && ( 306 < a23 && ( ((140 < a29) && (245 >= a29)) && ((input == 1) && ((a25==9) || (a25==10)))))) && (a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L694] COND FALSE !((!(a4==1) && (((((a3==1) && ((input == 2) && (((a25==9) || (a25==10)) || (a25==11)))) && ((140 < a29) && (245 >= a29)) ) && a23 <= -43 ) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L706] COND FALSE !(((((((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))) && (input == 6)) && (a3==1)) && 306 < a23 ) && (a4==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L712] COND FALSE !(( 306 < a23 && ((a8==15) && ( 277 < a29 && ((a4==1) && ((a3==1) && ((((a25==9) || (a25==10)) || (a25==11)) && (input == 5)))))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L717] COND FALSE !(((( 277 < a29 && ((a8==15) && (((input == 6) && a23 <= -43 ) && (a25==13)))) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L731] COND FALSE !(((a3==1) && (((!(a4==1) && ((( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) ))) && (input == 3))) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L738] COND FALSE !(((a3==1) && (( 306 < a23 && (((a4==1) && (((a25==12) || ((a25==10) || (a25==11))) && (input == 1))) && a29 <= 140 )) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L743] COND FALSE !((((( a23 <= -43 && ((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) ))))) && (a3==1)) && !(a4==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L750] COND FALSE !(((!(a4==1) && (((a8==15) && ( a29 <= 140 && (((a25==10) || (a25==11)) && (input == 5)))) && a23 <= -43 )) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L757] COND FALSE !((((((a8==15) && ((a3==1) && ( a23 <= -43 && (input == 5)))) && !(a4==1)) && (a25==13)) && 277 < a29 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L769] COND FALSE !(((a8==15) && ((a3==1) && ( 306 < a23 && ((((((a25==11) || (a25==12)) || (a25==13)) && (input == 1)) && (a4==1)) && ((245 < a29) && (277 >= a29)) ))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L774] COND FALSE !((!(a4==1) && (((((((a25==12) || (a25==13)) && (input == 6)) && (a8==15)) && a23 <= -43 ) && (a3==1)) && a29 <= 140 ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L780] COND FALSE !(((a3==1) && (( a23 <= -43 && (((input == 6) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && !(a4==1))) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L787] COND FALSE !((((( ((-43 < a23) && (138 >= a23)) && ((!(a4==1) && (input == 6)) && (a25==9))) && a29 <= 140 ) && (a3==1)) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L792] COND FALSE !((( a29 <= 140 && ((a3==1) && ((a8==15) && ((a25==13) && ( 306 < a23 && (input == 1)))))) && (a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L799] COND FALSE !(((a3==1) && (((a8==15) && (((( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9)))) && (input == 5)) && 306 < a23 )) && (a4==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L804] COND FALSE !((((((a8==15) && ((input == 4) && (( 277 < a29 && (a25==9)) || (( ((245 < a29) && (277 >= a29)) && (a25==12)) || ( ((245 < a29) && (277 >= a29)) && (a25==13)))))) && !(a4==1)) && a23 <= -43 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L816] COND FALSE !(((( ((-43 < a23) && (138 >= a23)) && (!(a4==1) && ((input == 5) && (( ((140 < a29) && (245 >= a29)) && (a25==10)) || (( a29 <= 140 && (a25==13)) || ((a25==9) && ((140 < a29) && (245 >= a29)) )))))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, a23=312, a25=13, a29=130, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L822] COND TRUE ( a29 <= 140 && ((((( 306 < a23 && (input == 2)) && (a25==13)) && (a4==1)) && (a3==1)) && (a8==15))) [L823] a29 = (((a29 / 5) + 165004) + 41645) [L824] return 23; VAL [\old(a23)=312, \old(a25)=13, \old(a29)=130, \old(a4)=1, \old(input)=2, \result=23, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1042] RET, EXPR calculate_output(input) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, calculate_output(input)=23, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=23] [L1042] output = calculate_output(input) [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=23] [L1042] CALL, EXPR calculate_output(input) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L23] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L26] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L29] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L32] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L35] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==13)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==12)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==12)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==10)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==9)) && (a3==1)) && 306 < a23 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !(((((( 277 < a29 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && ((138 < a23) && (306 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==11)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !(((((( ((140 < a29) && (245 >= a29)) && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !(((((( a29 <= 140 && (a4==1)) && (a25==13)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !(((((( ((245 < a29) && (277 >= a29)) && (a4==1)) && (a25==9)) && (a3==1)) && a23 <= -43 ) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !((( ((140 < a29) && (245 >= a29)) && ((a25==12) && ( a23 <= -43 && ((a8==15) && ((input == 6) && (a3==1)))))) && !(a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L214] COND FALSE !((!(a4==1) && (((a3==1) && ((((((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )) || ( ((245 < a29) && (277 >= a29)) && (a25==10))) && (input == 4)) && a23 <= -43 )) && (a8==15)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !(((a25==11) && (!(a4==1) && (((((input == 2) && (a3==1)) && a23 <= -43 ) && (a8==15)) && ((245 < a29) && (277 >= a29)) )))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((( a29 <= 140 && ((a3==1) && (((input == 5) && (a25==13)) && (a4==1)))) && (a8==15)) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !((((a8==15) && (((((((a4==1) && 277 < a29 ) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && (((a4==1) && 277 < a29 ) && (a25==13)))) || ((( a29 <= 140 && !(a4==1)) && (a25==9)) && a23 <= -43 )) && (input == 6))) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L240] COND FALSE !(((((input == 4) && (( a23 <= -43 && ((a25==9) && (!(a4==1) && a29 <= 140 ))) || (((( 277 < a29 && (a4==1)) && (a25==12)) && 306 < a23 ) || ( 306 < a23 && ((a25==13) && ( 277 < a29 && (a4==1))))))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L247] COND FALSE !((((a3==1) && (!(a4==1) && (( a29 <= 140 && ((input == 1) && ((a25==12) || ((a25==10) || (a25==11))))) && ((-43 < a23) && (138 >= a23)) ))) && (a8==15))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !(((( ((245 < a29) && (277 >= a29)) && (( a23 <= -43 && (!(a4==1) && (input == 1))) && (a25==11))) && (a8==15)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !(((((a4==1) && (((input == 1) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (((a25==13) && ((140 < a29) && (245 >= a29)) ) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))) && (a8==15))) && 306 < a23 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((( 277 < a29 && (((a8==15) && ( a23 <= -43 && ((input == 2) && (a3==1)))) && !(a4==1))) && (a25==13))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(( a29 <= 140 && ((((a8==15) && ((a3==1) && ((input == 1) && ((a25==12) || (a25==13))))) && !(a4==1)) && a23 <= -43 ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a4==1) && ((a8==15) && (((a3==1) && (((a25==9) || (a25==10)) && (input == 5))) && ((140 < a29) && (245 >= a29)) ))) && 306 < a23 )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L280] COND FALSE !(((a3==1) && (((((input == 5) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ( ((245 < a29) && (277 >= a29)) && (a25==9))))) && (a8==15)) && !(a4==1)) && a23 <= -43 ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a8==15) && ((((!(a4==1) && (((a25==12) || (a25==13)) && (input == 4))) && a23 <= -43 ) && a29 <= 140 ) && (a3==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L294] COND FALSE !(((a8==15) && (!(a4==1) && ( a23 <= -43 && ((a3==1) && ( 277 < a29 && (((a25==12) || ((a25==10) || (a25==11))) && (input == 6)))))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L299] COND FALSE !(( 306 < a23 && (((a8==15) && ((a3==1) && ((a4==1) && (((a25==11) || (a25==12)) && (input == 6))))) && ((140 < a29) && (245 >= a29)) ))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L305] COND FALSE !(((((a8==15) && ( a29 <= 140 && ( a23 <= -43 && ((input == 2) && ((a25==10) || (a25==11)))))) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L310] COND FALSE !(((a3==1) && ( ((245 < a29) && (277 >= a29)) && (((a4==1) && ((a8==15) && ((((a25==11) || (a25==12)) || (a25==13)) && (input == 5)))) && 306 < a23 )))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !(((((a8==15) && (((a4==1) && ((input == 2) && ((a25==13) || ((a25==11) || (a25==12))))) && ((245 < a29) && (277 >= a29)) )) && 306 < a23 ) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !((( 306 < a23 && ((a8==15) && ((((input == 6) && ((a25==9) || (a25==10))) && ((140 < a29) && (245 >= a29)) ) && (a3==1)))) && (a4==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((a8==15) && (((((a25==11) || (a25==12)) && (input == 4)) && 306 < a23 ) && (a3==1))) && (a4==1)) && ((140 < a29) && (245 >= a29)) )) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L334] COND FALSE !(( a23 <= -43 && ( ((140 < a29) && (245 >= a29)) && (((a8==15) && (((input == 4) && ((a25==11) || ((a25==9) || (a25==10)))) && !(a4==1))) && (a3==1))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !((((((((((a25==12) && ((245 < a29) && (277 >= a29)) ) || ((a25==13) && ((245 < a29) && (277 >= a29)) )) || ( 277 < a29 && (a25==9))) && (input == 1)) && a23 <= -43 ) && (a8==15)) && !(a4==1)) && (a3==1))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L346] COND FALSE !((!(a4==1) && ( a29 <= 140 && ((((((a25==12) || (a25==13)) && (input == 2)) && a23 <= -43 ) && (a3==1)) && (a8==15))))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L353] COND FALSE !(((a8==15) && (( 306 < a23 && ((a3==1) && ((input == 4) && (( ((245 < a29) && (277 >= a29)) && (a25==10)) || (( ((140 < a29) && (245 >= a29)) && (a25==13)) || ((a25==9) && ((245 < a29) && (277 >= a29)) )))))) && (a4==1)))) VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L358] COND TRUE ((((input == 3) && (( a23 <= -43 && ((!(a4==1) && a29 <= 140 ) && (a25==9))) || (( 306 < a23 && (( 277 < a29 && (a4==1)) && (a25==12))) || ((((a4==1) && 277 < a29 ) && (a25==13)) && 306 < a23 )))) && (a3==1)) && (a8==15)) [L359] a29 = (((a29 / 5) + -137957) * 2) [L360] a23 = ((((a23 - 0) / 5) / 5) + -127612) [L361] a4 = 1 [L362] a25 = 10 [L364] return -1; VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=3, \result=-1, a23=-127600, a25=10, a29=-193244, a3=1, a4=1, a8=15, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L1042] RET, EXPR calculate_output(input) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=-127600, a25=10, a29=-193244, a3=1, a4=1, a8=15, calculate_output(input)=-1, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=23] [L1042] output = calculate_output(input) [L1034] COND TRUE 1 [L1037] int input; [L1038] input = __VERIFIER_nondet_int() [L1039] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a23)=312, \old(a25)=10, \old(a29)=130, \old(a4)=1, a23=-127600, a25=10, a29=-193244, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L1042] CALL calculate_output(input) VAL [\old(a23)=-127600, \old(a25)=10, \old(a29)=-193244, \old(a4)=1, \old(input)=1, a23=-127600, a25=10, a29=-193244, a3=1, a4=1, a8=15, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L23] COND TRUE ((((( a29 <= 140 && (a4==1)) && (a25==10)) && (a3==1)) && a23 <= -43 ) && (a8==15)) VAL [\old(a23)=-127600, \old(a25)=10, \old(a29)=-193244, \old(a4)=1, \old(input)=1, a23=-127600, a25=10, a29=-193244, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] __VERIFIER_error() VAL [\old(a23)=-127600, \old(a25)=10, \old(a29)=-193244, \old(a4)=1, \old(input)=1, a23=-127600, a25=10, a29=-193244, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 292 locations, 1 error locations. UNSAFE Result, 673.2s OverallTime, 25 OverallIterations, 5 TraceHistogramMax, 607.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2911 SDtfs, 53255 SDslu, 6583 SDs, 0 SdLazy, 88223 SolverSat, 21963 SolverUnsat, 236 SolverUnknown, 0 SolverNotchecked, 439.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10675 GetRequests, 9341 SyntacticMatches, 209 SemanticMatches, 1125 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 36112 ImplicationChecksByTransitivity, 175.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54347occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 11.1s AbstIntTime, 16 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 50940 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 41.9s InterpolantComputationTime, 11073 NumberOfCodeBlocks, 11073 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 15293 ConstructedInterpolants, 357 QuantifiedInterpolants, 43499985 SizeOfPredicates, 59 NumberOfNonLiveVariables, 8319 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 56 InterpolantComputations, 10 PerfectInterpolantSequences, 7609/11105 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...