./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label34_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_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label34_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/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 e90b42bc6d1c81437da93cd8e9907ec68a3f9573 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-03 03:05:23,403 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 03:05:23,404 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 03:05:23,410 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 03:05:23,410 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 03:05:23,411 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 03:05:23,412 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 03:05:23,412 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 03:05:23,413 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 03:05:23,414 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 03:05:23,414 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 03:05:23,414 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 03:05:23,415 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 03:05:23,415 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 03:05:23,416 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 03:05:23,416 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 03:05:23,417 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 03:05:23,418 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 03:05:23,419 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 03:05:23,420 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 03:05:23,420 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 03:05:23,421 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 03:05:23,422 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 03:05:23,422 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 03:05:23,422 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 03:05:23,423 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 03:05:23,423 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 03:05:23,424 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 03:05:23,424 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 03:05:23,425 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 03:05:23,425 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 03:05:23,425 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 03:05:23,425 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 03:05:23,426 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 03:05:23,426 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 03:05:23,426 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 03:05:23,427 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 03:05:23,435 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 03:05:23,435 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 03:05:23,435 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 03:05:23,435 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 03:05:23,435 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 03:05:23,436 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 03:05:23,436 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 03:05:23,436 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 03:05:23,436 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 03:05:23,436 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 03:05:23,436 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 03:05:23,436 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 03:05:23,436 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 03:05:23,437 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 03:05:23,437 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 03:05:23,437 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 03:05:23,437 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 03:05:23,437 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 03:05:23,438 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 03:05:23,438 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 03:05:23,438 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 03:05:23,438 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 03:05:23,438 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 03:05:23,438 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 03:05:23,438 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 03:05:23,438 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 03:05:23,438 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 03:05:23,439 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 03:05:23,439 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 03:05:23,439 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 03:05:23,439 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 03:05:23,439 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 03:05:23,439 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 03:05:23,439 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 03:05:23,439 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 03:05:23,439 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 03:05:23,439 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_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/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 -> e90b42bc6d1c81437da93cd8e9907ec68a3f9573 [2018-12-03 03:05:23,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 03:05:23,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 03:05:23,466 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 03:05:23,467 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 03:05:23,467 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 03:05:23,467 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem11_label34_false-unreach-call.c [2018-12-03 03:05:23,501 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/bin-2019/utaipan/data/3a8a666a9/4dce8a19af404fd2a10f67824a51c2e4/FLAG0cc2ef162 [2018-12-03 03:05:23,921 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 03:05:23,921 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/sv-benchmarks/c/eca-rers2012/Problem11_label34_false-unreach-call.c [2018-12-03 03:05:23,932 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/bin-2019/utaipan/data/3a8a666a9/4dce8a19af404fd2a10f67824a51c2e4/FLAG0cc2ef162 [2018-12-03 03:05:24,250 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/bin-2019/utaipan/data/3a8a666a9/4dce8a19af404fd2a10f67824a51c2e4 [2018-12-03 03:05:24,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 03:05:24,258 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 03:05:24,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 03:05:24,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 03:05:24,264 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 03:05:24,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 03:05:24" (1/1) ... [2018-12-03 03:05:24,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22096c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:05:24, skipping insertion in model container [2018-12-03 03:05:24,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 03:05:24" (1/1) ... [2018-12-03 03:05:24,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 03:05:24,310 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 03:05:24,561 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 03:05:24,564 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 03:05:24,706 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 03:05:24,716 INFO L195 MainTranslator]: Completed translation [2018-12-03 03:05:24,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:05:24 WrapperNode [2018-12-03 03:05:24,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 03:05:24,717 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 03:05:24,717 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 03:05:24,717 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 03:05:24,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:05:24" (1/1) ... [2018-12-03 03:05:24,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:05:24" (1/1) ... [2018-12-03 03:05:24,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 03:05:24,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 03:05:24,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 03:05:24,742 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 03:05:24,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:05:24" (1/1) ... [2018-12-03 03:05:24,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:05:24" (1/1) ... [2018-12-03 03:05:24,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:05:24" (1/1) ... [2018-12-03 03:05:24,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:05:24" (1/1) ... [2018-12-03 03:05:24,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:05:24" (1/1) ... [2018-12-03 03:05:24,784 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:05:24" (1/1) ... [2018-12-03 03:05:24,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:05:24" (1/1) ... [2018-12-03 03:05:24,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 03:05:24,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 03:05:24,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 03:05:24,795 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 03:05:24,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:05:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/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-03 03:05:24,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 03:05:24,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 03:05:24,835 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-12-03 03:05:24,836 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-12-03 03:05:24,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 03:05:24,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 03:05:24,836 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 03:05:24,836 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 03:05:25,711 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 03:05:25,711 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 03:05:25,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:05:25 BoogieIcfgContainer [2018-12-03 03:05:25,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 03:05:25,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 03:05:25,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 03:05:25,715 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 03:05:25,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 03:05:24" (1/3) ... [2018-12-03 03:05:25,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98e5a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:05:25, skipping insertion in model container [2018-12-03 03:05:25,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:05:24" (2/3) ... [2018-12-03 03:05:25,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98e5a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:05:25, skipping insertion in model container [2018-12-03 03:05:25,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:05:25" (3/3) ... [2018-12-03 03:05:25,717 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label34_false-unreach-call.c [2018-12-03 03:05:25,725 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 03:05:25,730 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 03:05:25,740 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 03:05:25,762 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 03:05:25,762 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 03:05:25,762 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 03:05:25,763 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 03:05:25,763 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 03:05:25,763 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 03:05:25,763 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 03:05:25,763 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 03:05:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2018-12-03 03:05:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 03:05:25,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:05:25,783 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:05:25,784 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:05:25,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:05:25,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1631579171, now seen corresponding path program 1 times [2018-12-03 03:05:25,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:05:25,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:05:25,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:05:25,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:05:25,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:05:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:05:25,925 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-03 03:05:25,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:05:25,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 03:05:25,927 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:05:25,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:05:25,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:05:25,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:05:25,940 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 4 states. [2018-12-03 03:05:26,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:05:26,986 INFO L93 Difference]: Finished difference Result 994 states and 1776 transitions. [2018-12-03 03:05:26,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:05:26,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 03:05:26,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:05:26,999 INFO L225 Difference]: With dead ends: 994 [2018-12-03 03:05:26,999 INFO L226 Difference]: Without dead ends: 620 [2018-12-03 03:05:27,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:05:27,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2018-12-03 03:05:27,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 614. [2018-12-03 03:05:27,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-12-03 03:05:27,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 908 transitions. [2018-12-03 03:05:27,049 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 908 transitions. Word has length 14 [2018-12-03 03:05:27,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:05:27,049 INFO L480 AbstractCegarLoop]: Abstraction has 614 states and 908 transitions. [2018-12-03 03:05:27,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:05:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 908 transitions. [2018-12-03 03:05:27,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 03:05:27,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:05:27,052 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:05:27,052 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:05:27,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:05:27,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1634260565, now seen corresponding path program 1 times [2018-12-03 03:05:27,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:05:27,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:05:27,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:05:27,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:05:27,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:05:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:05:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:05:27,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:05:27,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 03:05:27,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:05:27,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 03:05:27,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 03:05:27,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-03 03:05:27,235 INFO L87 Difference]: Start difference. First operand 614 states and 908 transitions. Second operand 7 states. [2018-12-03 03:05:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:05:28,470 INFO L93 Difference]: Finished difference Result 1841 states and 2762 transitions. [2018-12-03 03:05:28,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 03:05:28,471 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2018-12-03 03:05:28,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:05:28,476 INFO L225 Difference]: With dead ends: 1841 [2018-12-03 03:05:28,476 INFO L226 Difference]: Without dead ends: 1233 [2018-12-03 03:05:28,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-12-03 03:05:28,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-12-03 03:05:28,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 823. [2018-12-03 03:05:28,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-03 03:05:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1139 transitions. [2018-12-03 03:05:28,509 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1139 transitions. Word has length 87 [2018-12-03 03:05:28,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:05:28,509 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1139 transitions. [2018-12-03 03:05:28,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 03:05:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1139 transitions. [2018-12-03 03:05:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 03:05:28,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:05:28,513 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-03 03:05:28,514 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:05:28,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:05:28,514 INFO L82 PathProgramCache]: Analyzing trace with hash 13471510, now seen corresponding path program 1 times [2018-12-03 03:05:28,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:05:28,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:05:28,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:05:28,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:05:28,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:05:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:05:28,658 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 14 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 03:05:28,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:05:28,658 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:05:28,659 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 160 with the following transitions: [2018-12-03 03:05:28,660 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [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], [506], [507], [510], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-03 03:05:28,687 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:05:28,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:05:29,085 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 03:05:29,086 INFO L272 AbstractInterpreter]: Visited 78 different actions 78 times. Never merged. Never widened. Performed 832 root evaluator evaluations with a maximum evaluation depth of 16. Performed 832 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Never found a fixpoint. Largest state had 28 variables. [2018-12-03 03:05:29,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:05:29,091 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 03:05:29,467 INFO L227 lantSequenceWeakener]: Weakened 150 states. On average, predicates are now at 72.8% of their original sizes. [2018-12-03 03:05:29,467 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 03:05:29,486 INFO L418 sIntCurrentIteration]: We unified 158 AI predicates to 158 [2018-12-03 03:05:29,486 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 03:05:29,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 03:05:29,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-12-03 03:05:29,487 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:05:29,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:05:29,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:05:29,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:05:29,487 INFO L87 Difference]: Start difference. First operand 823 states and 1139 transitions. Second operand 6 states. [2018-12-03 03:05:56,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:05:56,563 INFO L93 Difference]: Finished difference Result 1830 states and 2480 transitions. [2018-12-03 03:05:56,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 03:05:56,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2018-12-03 03:05:56,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:05:56,565 INFO L225 Difference]: With dead ends: 1830 [2018-12-03 03:05:56,566 INFO L226 Difference]: Without dead ends: 1013 [2018-12-03 03:05:56,566 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 159 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 03:05:56,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2018-12-03 03:05:56,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1012. [2018-12-03 03:05:56,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2018-12-03 03:05:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1337 transitions. [2018-12-03 03:05:56,579 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1337 transitions. Word has length 159 [2018-12-03 03:05:56,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:05:56,579 INFO L480 AbstractCegarLoop]: Abstraction has 1012 states and 1337 transitions. [2018-12-03 03:05:56,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:05:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1337 transitions. [2018-12-03 03:05:56,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-03 03:05:56,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:05:56,581 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:05:56,581 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:05:56,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:05:56,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1813306775, now seen corresponding path program 1 times [2018-12-03 03:05:56,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:05:56,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:05:56,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:05:56,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:05:56,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:05:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:05:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 03:05:56,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:05:56,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:05:56,666 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 162 with the following transitions: [2018-12-03 03:05:56,667 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [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], [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-03 03:05:56,670 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:05:56,670 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:05:56,826 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 03:05:56,826 INFO L272 AbstractInterpreter]: Visited 154 different actions 302 times. Merged at 4 different actions 4 times. Never widened. Performed 4006 root evaluator evaluations with a maximum evaluation depth of 8. Performed 4006 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-03 03:05:56,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:05:56,828 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 03:05:57,022 INFO L227 lantSequenceWeakener]: Weakened 158 states. On average, predicates are now at 74.67% of their original sizes. [2018-12-03 03:05:57,022 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 03:05:57,070 INFO L418 sIntCurrentIteration]: We unified 160 AI predicates to 160 [2018-12-03 03:05:57,070 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 03:05:57,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 03:05:57,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-12-03 03:05:57,071 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:05:57,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 03:05:57,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 03:05:57,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-03 03:05:57,071 INFO L87 Difference]: Start difference. First operand 1012 states and 1337 transitions. Second operand 10 states. [2018-12-03 03:06:22,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:06:22,674 INFO L93 Difference]: Finished difference Result 2794 states and 3979 transitions. [2018-12-03 03:06:22,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 03:06:22,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 161 [2018-12-03 03:06:22,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:06:22,678 INFO L225 Difference]: With dead ends: 2794 [2018-12-03 03:06:22,678 INFO L226 Difference]: Without dead ends: 1977 [2018-12-03 03:06:22,679 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 169 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-12-03 03:06:22,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2018-12-03 03:06:22,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1969. [2018-12-03 03:06:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2018-12-03 03:06:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2478 transitions. [2018-12-03 03:06:22,703 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2478 transitions. Word has length 161 [2018-12-03 03:06:22,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:06:22,704 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2478 transitions. [2018-12-03 03:06:22,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 03:06:22,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2478 transitions. [2018-12-03 03:06:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-03 03:06:22,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:06:22,706 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 03:06:22,706 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:06:22,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:06:22,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1327742716, now seen corresponding path program 1 times [2018-12-03 03:06:22,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:06:22,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:06:22,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:06:22,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:06:22,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:06:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:06:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 18 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:06:22,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:06:22,897 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:06:22,897 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-12-03 03:06:22,897 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [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], [510], [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], [710], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-03 03:06:22,900 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:06:22,900 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:06:23,236 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:06:23,236 INFO L272 AbstractInterpreter]: Visited 125 different actions 370 times. Merged at 6 different actions 17 times. Never widened. Performed 4949 root evaluator evaluations with a maximum evaluation depth of 18. Performed 4949 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-03 03:06:23,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:06:23,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:06:23,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:06:23,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/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-03 03:06:23,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:06:23,244 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:06:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:06:23,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:06:23,631 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 31 [2018-12-03 03:06:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:06:23,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:06:24,405 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:06:24,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:06:24,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-03 03:06:24,421 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:06:24,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 03:06:24,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 03:06:24,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-12-03 03:06:24,422 INFO L87 Difference]: Start difference. First operand 1969 states and 2478 transitions. Second operand 16 states. [2018-12-03 03:06:25,295 WARN L180 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 19 [2018-12-03 03:06:28,157 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-12-03 03:06:31,160 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-03 03:06:33,734 WARN L180 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2018-12-03 03:06:51,103 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-12-03 03:06:53,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:06:53,563 INFO L93 Difference]: Finished difference Result 6160 states and 9504 transitions. [2018-12-03 03:06:53,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 03:06:53,564 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 203 [2018-12-03 03:06:53,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:06:53,577 INFO L225 Difference]: With dead ends: 6160 [2018-12-03 03:06:53,577 INFO L226 Difference]: Without dead ends: 4573 [2018-12-03 03:06:53,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 397 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4312 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=1854, Invalid=10578, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 03:06:53,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4573 states. [2018-12-03 03:06:53,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4573 to 4389. [2018-12-03 03:06:53,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4389 states. [2018-12-03 03:06:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4389 states to 4389 states and 5699 transitions. [2018-12-03 03:06:53,666 INFO L78 Accepts]: Start accepts. Automaton has 4389 states and 5699 transitions. Word has length 203 [2018-12-03 03:06:53,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:06:53,666 INFO L480 AbstractCegarLoop]: Abstraction has 4389 states and 5699 transitions. [2018-12-03 03:06:53,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 03:06:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 4389 states and 5699 transitions. [2018-12-03 03:06:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-03 03:06:53,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:06:53,668 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 03:06:53,668 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:06:53,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:06:53,668 INFO L82 PathProgramCache]: Analyzing trace with hash -267582160, now seen corresponding path program 1 times [2018-12-03 03:06:53,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:06:53,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:06:53,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:06:53,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:06:53,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:06:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:06:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 18 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:06:53,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:06:53,838 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:06:53,838 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-12-03 03:06:53,838 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [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], [510], [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], [750], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-03 03:06:53,840 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:06:53,840 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:06:54,116 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:06:54,116 INFO L272 AbstractInterpreter]: Visited 135 different actions 398 times. Merged at 6 different actions 15 times. Never widened. Performed 5343 root evaluator evaluations with a maximum evaluation depth of 18. Performed 5343 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 3 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-03 03:06:54,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:06:54,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:06:54,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:06:54,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/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-03 03:06:54,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:06:54,124 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:06:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:06:54,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:06:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:06:54,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:06:54,777 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:06:54,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:06:54,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-12-03 03:06:54,792 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:06:54,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 03:06:54,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 03:06:54,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-12-03 03:06:54,793 INFO L87 Difference]: Start difference. First operand 4389 states and 5699 transitions. Second operand 16 states. [2018-12-03 03:06:58,033 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2018-12-03 03:06:59,393 WARN L180 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-12-03 03:07:00,840 WARN L180 SmtUtils]: Spent 883.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-03 03:07:02,133 WARN L180 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-03 03:07:03,614 WARN L180 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-03 03:07:04,893 WARN L180 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-12-03 03:07:06,037 WARN L180 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-12-03 03:07:07,291 WARN L180 SmtUtils]: Spent 890.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2018-12-03 03:07:09,058 WARN L180 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2018-12-03 03:07:12,084 WARN L180 SmtUtils]: Spent 905.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-12-03 03:07:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:07:16,114 INFO L93 Difference]: Finished difference Result 9770 states and 13977 transitions. [2018-12-03 03:07:16,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 03:07:16,115 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 213 [2018-12-03 03:07:16,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:07:16,140 INFO L225 Difference]: With dead ends: 9770 [2018-12-03 03:07:16,140 INFO L226 Difference]: Without dead ends: 5765 [2018-12-03 03:07:16,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 417 SyntacticMatches, 2 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4641 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=1983, Invalid=10894, Unknown=5, NotChecked=0, Total=12882 [2018-12-03 03:07:16,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5765 states. [2018-12-03 03:07:16,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5765 to 5358. [2018-12-03 03:07:16,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5358 states. [2018-12-03 03:07:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5358 states to 5358 states and 6964 transitions. [2018-12-03 03:07:16,254 INFO L78 Accepts]: Start accepts. Automaton has 5358 states and 6964 transitions. Word has length 213 [2018-12-03 03:07:16,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:07:16,255 INFO L480 AbstractCegarLoop]: Abstraction has 5358 states and 6964 transitions. [2018-12-03 03:07:16,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 03:07:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 5358 states and 6964 transitions. [2018-12-03 03:07:16,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-12-03 03:07:16,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:07:16,256 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 03:07:16,257 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:07:16,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:07:16,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1680814493, now seen corresponding path program 1 times [2018-12-03 03:07:16,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:07:16,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:07:16,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:07:16,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:07:16,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:07:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:07:16,308 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 03:07:16,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:07:16,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:07:16,308 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:07:16,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:07:16,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:07:16,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:07:16,309 INFO L87 Difference]: Start difference. First operand 5358 states and 6964 transitions. Second operand 3 states. [2018-12-03 03:07:16,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:07:16,879 INFO L93 Difference]: Finished difference Result 13011 states and 17591 transitions. [2018-12-03 03:07:16,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:07:16,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2018-12-03 03:07:16,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:07:16,894 INFO L225 Difference]: With dead ends: 13011 [2018-12-03 03:07:16,894 INFO L226 Difference]: Without dead ends: 8037 [2018-12-03 03:07:16,899 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-03 03:07:16,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8037 states. [2018-12-03 03:07:16,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8037 to 7650. [2018-12-03 03:07:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7650 states. [2018-12-03 03:07:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7650 states to 7650 states and 9901 transitions. [2018-12-03 03:07:16,994 INFO L78 Accepts]: Start accepts. Automaton has 7650 states and 9901 transitions. Word has length 214 [2018-12-03 03:07:16,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:07:16,994 INFO L480 AbstractCegarLoop]: Abstraction has 7650 states and 9901 transitions. [2018-12-03 03:07:16,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:07:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 7650 states and 9901 transitions. [2018-12-03 03:07:16,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-03 03:07:16,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:07:16,996 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 03:07:16,997 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:07:16,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:07:16,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1215552756, now seen corresponding path program 1 times [2018-12-03 03:07:16,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:07:16,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:07:16,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:07:16,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:07:16,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:07:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:07:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 20 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:07:17,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:07:17,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:07:17,199 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 219 with the following transitions: [2018-12-03 03:07:17,200 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [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], [510], [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-03 03:07:17,202 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:07:17,203 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:07:17,483 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:07:17,483 INFO L272 AbstractInterpreter]: Visited 140 different actions 413 times. Merged at 6 different actions 15 times. Never widened. Performed 5782 root evaluator evaluations with a maximum evaluation depth of 18. Performed 5782 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 3 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-03 03:07:17,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:07:17,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:07:17,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:07:17,485 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/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-03 03:07:17,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:07:17,491 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:07:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:07:17,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:07:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 85 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:07:17,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:07:17,872 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:07:17,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:07:17,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2018-12-03 03:07:17,887 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:07:17,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 03:07:17,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 03:07:17,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-12-03 03:07:17,888 INFO L87 Difference]: Start difference. First operand 7650 states and 9901 transitions. Second operand 16 states. [2018-12-03 03:07:24,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:07:24,447 INFO L93 Difference]: Finished difference Result 16373 states and 28249 transitions. [2018-12-03 03:07:24,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 03:07:24,447 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 218 [2018-12-03 03:07:24,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:07:24,486 INFO L225 Difference]: With dead ends: 16373 [2018-12-03 03:07:24,486 INFO L226 Difference]: Without dead ends: 10834 [2018-12-03 03:07:24,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 427 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=965, Invalid=3591, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 03:07:24,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10834 states. [2018-12-03 03:07:24,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10834 to 10261. [2018-12-03 03:07:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10261 states. [2018-12-03 03:07:24,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10261 states to 10261 states and 13759 transitions. [2018-12-03 03:07:24,702 INFO L78 Accepts]: Start accepts. Automaton has 10261 states and 13759 transitions. Word has length 218 [2018-12-03 03:07:24,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:07:24,703 INFO L480 AbstractCegarLoop]: Abstraction has 10261 states and 13759 transitions. [2018-12-03 03:07:24,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 03:07:24,703 INFO L276 IsEmpty]: Start isEmpty. Operand 10261 states and 13759 transitions. [2018-12-03 03:07:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-12-03 03:07:24,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:07:24,705 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 03:07:24,705 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:07:24,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:07:24,705 INFO L82 PathProgramCache]: Analyzing trace with hash 326215368, now seen corresponding path program 1 times [2018-12-03 03:07:24,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:07:24,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:07:24,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:07:24,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:07:24,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:07:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:07:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-12-03 03:07:24,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:07:24,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:07:24,764 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:07:24,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:07:24,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:07:24,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:07:24,764 INFO L87 Difference]: Start difference. First operand 10261 states and 13759 transitions. Second operand 3 states. [2018-12-03 03:07:25,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:07:25,364 INFO L93 Difference]: Finished difference Result 24361 states and 33892 transitions. [2018-12-03 03:07:25,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:07:25,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2018-12-03 03:07:25,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:07:25,386 INFO L225 Difference]: With dead ends: 24361 [2018-12-03 03:07:25,386 INFO L226 Difference]: Without dead ends: 14484 [2018-12-03 03:07:25,396 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-03 03:07:25,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14484 states. [2018-12-03 03:07:25,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14484 to 14073. [2018-12-03 03:07:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14073 states. [2018-12-03 03:07:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14073 states to 14073 states and 18856 transitions. [2018-12-03 03:07:25,568 INFO L78 Accepts]: Start accepts. Automaton has 14073 states and 18856 transitions. Word has length 236 [2018-12-03 03:07:25,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:07:25,569 INFO L480 AbstractCegarLoop]: Abstraction has 14073 states and 18856 transitions. [2018-12-03 03:07:25,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:07:25,569 INFO L276 IsEmpty]: Start isEmpty. Operand 14073 states and 18856 transitions. [2018-12-03 03:07:25,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-03 03:07:25,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:07:25,571 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:07:25,571 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:07:25,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:07:25,571 INFO L82 PathProgramCache]: Analyzing trace with hash 739456600, now seen corresponding path program 1 times [2018-12-03 03:07:25,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:07:25,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:07:25,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:07:25,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:07:25,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:07:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:07:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-12-03 03:07:25,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:07:25,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:07:25,632 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:07:25,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:07:25,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:07:25,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:07:25,633 INFO L87 Difference]: Start difference. First operand 14073 states and 18856 transitions. Second operand 3 states. [2018-12-03 03:07:26,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:07:26,609 INFO L93 Difference]: Finished difference Result 30030 states and 40953 transitions. [2018-12-03 03:07:26,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:07:26,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2018-12-03 03:07:26,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:07:26,635 INFO L225 Difference]: With dead ends: 30030 [2018-12-03 03:07:26,635 INFO L226 Difference]: Without dead ends: 16151 [2018-12-03 03:07:26,651 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-03 03:07:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16151 states. [2018-12-03 03:07:26,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16151 to 15956. [2018-12-03 03:07:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15956 states. [2018-12-03 03:07:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15956 states to 15956 states and 21005 transitions. [2018-12-03 03:07:26,858 INFO L78 Accepts]: Start accepts. Automaton has 15956 states and 21005 transitions. Word has length 241 [2018-12-03 03:07:26,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:07:26,859 INFO L480 AbstractCegarLoop]: Abstraction has 15956 states and 21005 transitions. [2018-12-03 03:07:26,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:07:26,859 INFO L276 IsEmpty]: Start isEmpty. Operand 15956 states and 21005 transitions. [2018-12-03 03:07:26,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-03 03:07:26,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:07:26,861 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:07:26,861 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:07:26,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:07:26,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1285043417, now seen corresponding path program 1 times [2018-12-03 03:07:26,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:07:26,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:07:26,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:07:26,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:07:26,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:07:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:07:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-03 03:07:26,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:07:26,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:07:26,938 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:07:26,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:07:26,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:07:26,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:07:26,938 INFO L87 Difference]: Start difference. First operand 15956 states and 21005 transitions. Second operand 3 states. [2018-12-03 03:07:27,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:07:27,569 INFO L93 Difference]: Finished difference Result 31482 states and 42595 transitions. [2018-12-03 03:07:27,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:07:27,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2018-12-03 03:07:27,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:07:27,595 INFO L225 Difference]: With dead ends: 31482 [2018-12-03 03:07:27,595 INFO L226 Difference]: Without dead ends: 18023 [2018-12-03 03:07:27,609 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-03 03:07:27,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18023 states. [2018-12-03 03:07:27,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18023 to 17835. [2018-12-03 03:07:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17835 states. [2018-12-03 03:07:27,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17835 states to 17835 states and 23517 transitions. [2018-12-03 03:07:27,792 INFO L78 Accepts]: Start accepts. Automaton has 17835 states and 23517 transitions. Word has length 283 [2018-12-03 03:07:27,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:07:27,793 INFO L480 AbstractCegarLoop]: Abstraction has 17835 states and 23517 transitions. [2018-12-03 03:07:27,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:07:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 17835 states and 23517 transitions. [2018-12-03 03:07:27,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-12-03 03:07:27,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:07:27,796 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-03 03:07:27,796 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:07:27,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:07:27,796 INFO L82 PathProgramCache]: Analyzing trace with hash 920184109, now seen corresponding path program 1 times [2018-12-03 03:07:27,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:07:27,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:07:27,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:07:27,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:07:27,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:07:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:07:28,026 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 33 proven. 217 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 03:07:28,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:07:28,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:07:28,027 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 300 with the following transitions: [2018-12-03 03:07:28,027 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [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], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [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], [750], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-03 03:07:28,029 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:07:28,029 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:07:28,471 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:07:28,471 INFO L272 AbstractInterpreter]: Visited 136 different actions 536 times. Merged at 7 different actions 24 times. Never widened. Performed 7453 root evaluator evaluations with a maximum evaluation depth of 18. Performed 7453 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 7 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-03 03:07:28,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:07:28,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:07:28,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:07:28,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/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-03 03:07:28,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:07:28,479 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:07:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:07:28,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:07:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 168 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-03 03:07:28,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:07:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 168 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-03 03:07:28,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:07:28,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 18 [2018-12-03 03:07:28,938 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:07:28,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 03:07:28,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 03:07:28,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-12-03 03:07:28,939 INFO L87 Difference]: Start difference. First operand 17835 states and 23517 transitions. Second operand 16 states. [2018-12-03 03:07:31,361 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2018-12-03 03:07:33,375 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2018-12-03 03:07:33,631 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-12-03 03:07:34,561 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2018-12-03 03:07:35,241 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2018-12-03 03:07:38,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:07:38,773 INFO L93 Difference]: Finished difference Result 35502 states and 49630 transitions. [2018-12-03 03:07:38,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 03:07:38,773 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 299 [2018-12-03 03:07:38,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:07:38,808 INFO L225 Difference]: With dead ends: 35502 [2018-12-03 03:07:38,808 INFO L226 Difference]: Without dead ends: 20164 [2018-12-03 03:07:38,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=965, Invalid=4291, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 03:07:38,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20164 states. [2018-12-03 03:07:39,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20164 to 18337. [2018-12-03 03:07:39,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18337 states. [2018-12-03 03:07:39,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18337 states to 18337 states and 24046 transitions. [2018-12-03 03:07:39,067 INFO L78 Accepts]: Start accepts. Automaton has 18337 states and 24046 transitions. Word has length 299 [2018-12-03 03:07:39,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:07:39,068 INFO L480 AbstractCegarLoop]: Abstraction has 18337 states and 24046 transitions. [2018-12-03 03:07:39,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 03:07:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 18337 states and 24046 transitions. [2018-12-03 03:07:39,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-12-03 03:07:39,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:07:39,071 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:07:39,071 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:07:39,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:07:39,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1279902127, now seen corresponding path program 1 times [2018-12-03 03:07:39,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:07:39,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:07:39,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:07:39,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:07:39,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:07:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:07:39,209 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-12-03 03:07:39,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:07:39,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:07:39,210 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 306 with the following transitions: [2018-12-03 03:07:39,210 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [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], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [850], [851], [862], [866], [869], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-03 03:07:39,212 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:07:39,212 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:07:39,430 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:07:39,430 INFO L272 AbstractInterpreter]: Visited 156 different actions 613 times. Merged at 6 different actions 21 times. Never widened. Performed 8559 root evaluator evaluations with a maximum evaluation depth of 8. Performed 8559 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 4 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-03 03:07:39,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:07:39,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:07:39,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:07:39,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/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-03 03:07:39,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:07:39,439 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:07:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:07:39,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:07:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-12-03 03:07:39,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:07:39,675 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-12-03 03:07:39,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 03:07:39,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 11 [2018-12-03 03:07:39,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:07:39,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:07:39,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:07:39,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-03 03:07:39,690 INFO L87 Difference]: Start difference. First operand 18337 states and 24046 transitions. Second operand 6 states. [2018-12-03 03:07:40,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:07:40,993 INFO L93 Difference]: Finished difference Result 44876 states and 59660 transitions. [2018-12-03 03:07:40,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 03:07:40,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 305 [2018-12-03 03:07:40,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:07:41,037 INFO L225 Difference]: With dead ends: 44876 [2018-12-03 03:07:41,037 INFO L226 Difference]: Without dead ends: 27890 [2018-12-03 03:07:41,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 609 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-03 03:07:41,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27890 states. [2018-12-03 03:07:41,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27890 to 25820. [2018-12-03 03:07:41,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25820 states. [2018-12-03 03:07:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25820 states to 25820 states and 33583 transitions. [2018-12-03 03:07:41,379 INFO L78 Accepts]: Start accepts. Automaton has 25820 states and 33583 transitions. Word has length 305 [2018-12-03 03:07:41,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:07:41,379 INFO L480 AbstractCegarLoop]: Abstraction has 25820 states and 33583 transitions. [2018-12-03 03:07:41,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:07:41,380 INFO L276 IsEmpty]: Start isEmpty. Operand 25820 states and 33583 transitions. [2018-12-03 03:07:41,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-12-03 03:07:41,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:07:41,383 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-03 03:07:41,383 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:07:41,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:07:41,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1269064905, now seen corresponding path program 1 times [2018-12-03 03:07:41,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:07:41,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:07:41,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:07:41,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:07:41,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:07:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:07:41,470 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-12-03 03:07:41,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:07:41,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 03:07:41,470 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:07:41,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:07:41,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:07:41,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:07:41,471 INFO L87 Difference]: Start difference. First operand 25820 states and 33583 transitions. Second operand 4 states. [2018-12-03 03:07:42,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:07:42,399 INFO L93 Difference]: Finished difference Result 54224 states and 71641 transitions. [2018-12-03 03:07:42,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:07:42,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2018-12-03 03:07:42,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:07:42,447 INFO L225 Difference]: With dead ends: 54224 [2018-12-03 03:07:42,447 INFO L226 Difference]: Without dead ends: 30903 [2018-12-03 03:07:42,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:07:42,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30903 states. [2018-12-03 03:07:42,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30903 to 27139. [2018-12-03 03:07:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27139 states. [2018-12-03 03:07:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27139 states to 27139 states and 34072 transitions. [2018-12-03 03:07:42,805 INFO L78 Accepts]: Start accepts. Automaton has 27139 states and 34072 transitions. Word has length 309 [2018-12-03 03:07:42,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:07:42,806 INFO L480 AbstractCegarLoop]: Abstraction has 27139 states and 34072 transitions. [2018-12-03 03:07:42,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:07:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 27139 states and 34072 transitions. [2018-12-03 03:07:42,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-12-03 03:07:42,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:07:42,810 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2018-12-03 03:07:42,810 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:07:42,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:07:42,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1297899456, now seen corresponding path program 1 times [2018-12-03 03:07:42,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:07:42,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:07:42,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:07:42,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:07:42,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:07:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:07:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 34 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:07:43,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:07:43,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:07:43,285 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 315 with the following transitions: [2018-12-03 03:07:43,285 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [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], [510], [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], [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-03 03:07:43,287 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:07:43,287 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:07:43,695 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:07:43,695 INFO L272 AbstractInterpreter]: Visited 136 different actions 405 times. Merged at 7 different actions 19 times. Never widened. Performed 5425 root evaluator evaluations with a maximum evaluation depth of 18. Performed 5425 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 5 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-03 03:07:43,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:07:43,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:07:43,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:07:43,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/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-03 03:07:43,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:07:43,738 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:07:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:07:43,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:07:49,461 WARN L180 SmtUtils]: Spent 3.58 s on a formula simplification. DAG size of input: 151 DAG size of output: 24 [2018-12-03 03:07:50,764 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 23 proven. 147 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-12-03 03:07:50,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:07:51,079 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 168 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-12-03 03:07:51,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:07:51,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 5] total 24 [2018-12-03 03:07:51,094 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:07:51,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 03:07:51,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 03:07:51,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=464, Unknown=2, NotChecked=0, Total=552 [2018-12-03 03:07:51,095 INFO L87 Difference]: Start difference. First operand 27139 states and 34072 transitions. Second operand 22 states. [2018-12-03 03:08:07,581 WARN L180 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2018-12-03 03:09:08,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:09:08,451 INFO L93 Difference]: Finished difference Result 61566 states and 78794 transitions. [2018-12-03 03:09:08,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 03:09:08,452 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 314 [2018-12-03 03:09:08,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:09:08,506 INFO L225 Difference]: With dead ends: 61566 [2018-12-03 03:09:08,507 INFO L226 Difference]: Without dead ends: 34387 [2018-12-03 03:09:08,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 620 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3724 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=1554, Invalid=9568, Unknown=8, NotChecked=0, Total=11130 [2018-12-03 03:09:08,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34387 states. [2018-12-03 03:09:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34387 to 34034. [2018-12-03 03:09:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34034 states. [2018-12-03 03:09:08,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34034 states to 34034 states and 41296 transitions. [2018-12-03 03:09:08,934 INFO L78 Accepts]: Start accepts. Automaton has 34034 states and 41296 transitions. Word has length 314 [2018-12-03 03:09:08,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:09:08,934 INFO L480 AbstractCegarLoop]: Abstraction has 34034 states and 41296 transitions. [2018-12-03 03:09:08,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 03:09:08,934 INFO L276 IsEmpty]: Start isEmpty. Operand 34034 states and 41296 transitions. [2018-12-03 03:09:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-12-03 03:09:08,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:09:08,937 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-12-03 03:09:08,937 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:09:08,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:09:08,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1630753072, now seen corresponding path program 1 times [2018-12-03 03:09:08,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:09:08,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:09:08,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:09:08,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:09:08,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:09:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:09:09,056 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 29 proven. 140 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 03:09:09,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:09:09,056 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:09:09,056 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 321 with the following transitions: [2018-12-03 03:09:09,056 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [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], [510], [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], [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-03 03:09:09,058 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:09:09,058 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:09:09,317 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:09:09,317 INFO L272 AbstractInterpreter]: Visited 141 different actions 419 times. Merged at 7 different actions 18 times. Never widened. Performed 5831 root evaluator evaluations with a maximum evaluation depth of 18. Performed 5831 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 5 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-03 03:09:09,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:09:09,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:09:09,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:09:09,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/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-03 03:09:09,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:09:09,325 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:09:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:09:09,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:09:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 163 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-03 03:09:11,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:09:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 125 proven. 73 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-03 03:09:12,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:09:12,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 11 [2018-12-03 03:09:12,084 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:09:12,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 03:09:12,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 03:09:12,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=74, Unknown=2, NotChecked=0, Total=110 [2018-12-03 03:09:12,084 INFO L87 Difference]: Start difference. First operand 34034 states and 41296 transitions. Second operand 9 states. [2018-12-03 03:09:15,120 WARN L180 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2018-12-03 03:09:33,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:09:33,960 INFO L93 Difference]: Finished difference Result 71152 states and 87881 transitions. [2018-12-03 03:09:33,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 03:09:33,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 320 [2018-12-03 03:09:33,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:09:34,026 INFO L225 Difference]: With dead ends: 71152 [2018-12-03 03:09:34,026 INFO L226 Difference]: Without dead ends: 39806 [2018-12-03 03:09:34,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 648 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=159, Invalid=391, Unknown=2, NotChecked=0, Total=552 [2018-12-03 03:09:34,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39806 states. [2018-12-03 03:09:34,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39806 to 39570. [2018-12-03 03:09:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39570 states. [2018-12-03 03:09:34,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39570 states to 39570 states and 46409 transitions. [2018-12-03 03:09:34,537 INFO L78 Accepts]: Start accepts. Automaton has 39570 states and 46409 transitions. Word has length 320 [2018-12-03 03:09:34,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:09:34,538 INFO L480 AbstractCegarLoop]: Abstraction has 39570 states and 46409 transitions. [2018-12-03 03:09:34,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 03:09:34,538 INFO L276 IsEmpty]: Start isEmpty. Operand 39570 states and 46409 transitions. [2018-12-03 03:09:34,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-12-03 03:09:34,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:09:34,541 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 03:09:34,542 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:09:34,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:09:34,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1932530720, now seen corresponding path program 1 times [2018-12-03 03:09:34,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:09:34,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:09:34,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:09:34,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:09:34,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:09:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:09:34,917 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 159 proven. 77 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 03:09:34,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:09:34,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:09:34,918 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 331 with the following transitions: [2018-12-03 03:09:34,918 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [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], [506], [507], [510], [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], [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], [986], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-03 03:09:34,920 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:09:34,920 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:09:35,285 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:09:35,285 INFO L272 AbstractInterpreter]: Visited 181 different actions 536 times. Merged at 7 different actions 15 times. Never widened. Performed 7372 root evaluator evaluations with a maximum evaluation depth of 18. Performed 7372 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 4 fixpoints after 2 different actions. Largest state had 28 variables. [2018-12-03 03:09:35,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:09:35,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:09:35,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:09:35,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/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-03 03:09:35,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:09:35,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:09:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:09:35,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:09:35,436 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 167 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-03 03:09:35,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:09:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 167 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-03 03:09:35,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:09:35,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 19 [2018-12-03 03:09:35,727 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:09:35,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 03:09:35,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 03:09:35,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-12-03 03:09:35,728 INFO L87 Difference]: Start difference. First operand 39570 states and 46409 transitions. Second operand 17 states. [2018-12-03 03:09:39,845 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 27 [2018-12-03 03:09:40,269 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2018-12-03 03:09:43,369 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 25 [2018-12-03 03:09:43,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:09:43,878 INFO L93 Difference]: Finished difference Result 83832 states and 104121 transitions. [2018-12-03 03:09:43,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 03:09:43,879 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 330 [2018-12-03 03:09:43,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:09:43,968 INFO L225 Difference]: With dead ends: 83832 [2018-12-03 03:09:43,968 INFO L226 Difference]: Without dead ends: 43995 [2018-12-03 03:09:44,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 676 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=596, Invalid=2266, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 03:09:44,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43995 states. [2018-12-03 03:09:44,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43995 to 40854. [2018-12-03 03:09:44,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40854 states. [2018-12-03 03:09:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40854 states to 40854 states and 46548 transitions. [2018-12-03 03:09:44,595 INFO L78 Accepts]: Start accepts. Automaton has 40854 states and 46548 transitions. Word has length 330 [2018-12-03 03:09:44,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:09:44,595 INFO L480 AbstractCegarLoop]: Abstraction has 40854 states and 46548 transitions. [2018-12-03 03:09:44,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 03:09:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 40854 states and 46548 transitions. [2018-12-03 03:09:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-12-03 03:09:44,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:09:44,599 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 03:09:44,599 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:09:44,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:09:44,599 INFO L82 PathProgramCache]: Analyzing trace with hash 192064095, now seen corresponding path program 1 times [2018-12-03 03:09:44,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:09:44,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:09:44,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:09:44,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:09:44,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:09:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:09:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 216 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:09:45,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:09:45,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:09:45,040 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 357 with the following transitions: [2018-12-03 03:09:45,040 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [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], [510], [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], [819], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-03 03:09:45,041 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:09:45,041 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:09:45,315 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:09:45,315 INFO L272 AbstractInterpreter]: Visited 150 different actions 450 times. Merged at 7 different actions 22 times. Never widened. Performed 6331 root evaluator evaluations with a maximum evaluation depth of 18. Performed 6331 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 5 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-03 03:09:45,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:09:45,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:09:45,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:09:45,317 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/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-03 03:09:45,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:09:45,323 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:09:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:09:45,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:09:46,373 WARN L180 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 45 [2018-12-03 03:09:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 149 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:09:46,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:09:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 216 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:09:47,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:09:47,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 32 [2018-12-03 03:09:47,353 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:09:47,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 03:09:47,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 03:09:47,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2018-12-03 03:09:47,353 INFO L87 Difference]: Start difference. First operand 40854 states and 46548 transitions. Second operand 25 states. [2018-12-03 03:09:54,323 WARN L180 SmtUtils]: Spent 898.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2018-12-03 03:09:55,096 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2018-12-03 03:09:55,475 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2018-12-03 03:09:58,017 WARN L180 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2018-12-03 03:09:59,185 WARN L180 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2018-12-03 03:10:00,334 WARN L180 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-12-03 03:10:01,309 WARN L180 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2018-12-03 03:10:03,194 WARN L180 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2018-12-03 03:10:05,863 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-12-03 03:10:07,137 WARN L180 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2018-12-03 03:10:07,662 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2018-12-03 03:10:09,936 WARN L180 SmtUtils]: Spent 843.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2018-12-03 03:10:10,789 WARN L180 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2018-12-03 03:10:17,169 WARN L180 SmtUtils]: Spent 881.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2018-12-03 03:10:18,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:10:18,555 INFO L93 Difference]: Finished difference Result 87045 states and 103256 transitions. [2018-12-03 03:10:18,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-12-03 03:10:18,557 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 356 [2018-12-03 03:10:18,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:10:18,648 INFO L225 Difference]: With dead ends: 87045 [2018-12-03 03:10:18,649 INFO L226 Difference]: Without dead ends: 46575 [2018-12-03 03:10:18,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 877 GetRequests, 709 SyntacticMatches, 5 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10009 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=4265, Invalid=22795, Unknown=0, NotChecked=0, Total=27060 [2018-12-03 03:10:18,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46575 states. [2018-12-03 03:10:19,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46575 to 44444. [2018-12-03 03:10:19,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44444 states. [2018-12-03 03:10:19,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44444 states to 44444 states and 50490 transitions. [2018-12-03 03:10:19,348 INFO L78 Accepts]: Start accepts. Automaton has 44444 states and 50490 transitions. Word has length 356 [2018-12-03 03:10:19,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:10:19,349 INFO L480 AbstractCegarLoop]: Abstraction has 44444 states and 50490 transitions. [2018-12-03 03:10:19,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 03:10:19,349 INFO L276 IsEmpty]: Start isEmpty. Operand 44444 states and 50490 transitions. [2018-12-03 03:10:19,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-12-03 03:10:19,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:10:19,353 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:10:19,353 INFO L423 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:10:19,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:10:19,354 INFO L82 PathProgramCache]: Analyzing trace with hash 696011543, now seen corresponding path program 1 times [2018-12-03 03:10:19,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:10:19,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:10:19,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:10:19,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:10:19,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:10:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:10:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 199 proven. 221 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-03 03:10:19,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:10:19,485 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:10:19,485 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 371 with the following transitions: [2018-12-03 03:10:19,485 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [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], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [551], [554], [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], [710], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-03 03:10:19,487 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:10:19,487 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:10:19,834 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:10:19,834 INFO L272 AbstractInterpreter]: Visited 127 different actions 379 times. Merged at 7 different actions 20 times. Never widened. Performed 5018 root evaluator evaluations with a maximum evaluation depth of 18. Performed 5018 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 5 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-03 03:10:19,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:10:19,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:10:19,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:10:19,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/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-03 03:10:19,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:10:19,844 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:10:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:10:19,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:10:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 406 proven. 2 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-12-03 03:10:19,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:10:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 203 proven. 73 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-12-03 03:10:20,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:10:20,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2018-12-03 03:10:20,049 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:10:20,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 03:10:20,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 03:10:20,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-03 03:10:20,050 INFO L87 Difference]: Start difference. First operand 44444 states and 50490 transitions. Second operand 7 states. [2018-12-03 03:10:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:10:21,192 INFO L93 Difference]: Finished difference Result 86004 states and 98903 transitions. [2018-12-03 03:10:21,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 03:10:21,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 370 [2018-12-03 03:10:21,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:10:21,266 INFO L225 Difference]: With dead ends: 86004 [2018-12-03 03:10:21,266 INFO L226 Difference]: Without dead ends: 43640 [2018-12-03 03:10:21,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 740 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-12-03 03:10:21,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43640 states. [2018-12-03 03:10:21,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43640 to 41378. [2018-12-03 03:10:21,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41378 states. [2018-12-03 03:10:21,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41378 states to 41378 states and 45851 transitions. [2018-12-03 03:10:21,984 INFO L78 Accepts]: Start accepts. Automaton has 41378 states and 45851 transitions. Word has length 370 [2018-12-03 03:10:21,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:10:21,984 INFO L480 AbstractCegarLoop]: Abstraction has 41378 states and 45851 transitions. [2018-12-03 03:10:21,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 03:10:21,985 INFO L276 IsEmpty]: Start isEmpty. Operand 41378 states and 45851 transitions. [2018-12-03 03:10:21,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-12-03 03:10:21,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:10:21,988 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:10:21,988 INFO L423 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:10:21,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:10:21,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1672579873, now seen corresponding path program 1 times [2018-12-03 03:10:21,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:10:21,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:10:21,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:10:21,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:10:21,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:10:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:10:22,108 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 208 proven. 73 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-12-03 03:10:22,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:10:22,108 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:10:22,108 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 375 with the following transitions: [2018-12-03 03:10:22,108 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [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], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [566], [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], [710], [1084], [1088], [1097], [1101], [1103], [1108], [1109], [1110], [1112], [1113] [2018-12-03 03:10:22,110 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:10:22,110 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:10:22,448 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:10:22,448 INFO L272 AbstractInterpreter]: Visited 127 different actions 380 times. Merged at 8 different actions 21 times. Never widened. Performed 5054 root evaluator evaluations with a maximum evaluation depth of 18. Performed 5054 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 7 fixpoints after 4 different actions. Largest state had 28 variables. [2018-12-03 03:10:22,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:10:22,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:10:22,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:10:22,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/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-03 03:10:22,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:10:22,456 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:10:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:10:22,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:10:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 251 proven. 2 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-12-03 03:10:22,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:10:22,739 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 251 proven. 2 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2018-12-03 03:10:22,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:10:22,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-12-03 03:10:22,755 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:10:22,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 03:10:22,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 03:10:22,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-03 03:10:22,755 INFO L87 Difference]: Start difference. First operand 41378 states and 45851 transitions. Second operand 9 states. [2018-12-03 03:10:26,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:10:26,943 INFO L93 Difference]: Finished difference Result 89847 states and 100143 transitions. [2018-12-03 03:10:26,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 03:10:26,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 374 [2018-12-03 03:10:26,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:10:27,009 INFO L225 Difference]: With dead ends: 89847 [2018-12-03 03:10:27,010 INFO L226 Difference]: Without dead ends: 48085 [2018-12-03 03:10:27,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 807 GetRequests, 771 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=303, Invalid=1103, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 03:10:27,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48085 states. [2018-12-03 03:10:27,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48085 to 38444. [2018-12-03 03:10:27,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38444 states. [2018-12-03 03:10:27,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38444 states to 38444 states and 42071 transitions. [2018-12-03 03:10:27,607 INFO L78 Accepts]: Start accepts. Automaton has 38444 states and 42071 transitions. Word has length 374 [2018-12-03 03:10:27,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:10:27,607 INFO L480 AbstractCegarLoop]: Abstraction has 38444 states and 42071 transitions. [2018-12-03 03:10:27,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 03:10:27,607 INFO L276 IsEmpty]: Start isEmpty. Operand 38444 states and 42071 transitions. [2018-12-03 03:10:27,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-12-03 03:10:27,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:10:27,611 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 03:10:27,612 INFO L423 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:10:27,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:10:27,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1980121018, now seen corresponding path program 1 times [2018-12-03 03:10:27,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:10:27,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:10:27,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:10:27,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:10:27,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:10:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:10:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 171 proven. 141 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 03:10:28,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:10:28,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:10:28,020 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 401 with the following transitions: [2018-12-03 03:10:28,020 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [21], [23], [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], [510], [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], [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-03 03:10:28,022 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:10:28,022 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:10:34,123 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:10:34,123 INFO L272 AbstractInterpreter]: Visited 176 different actions 525 times. Merged at 7 different actions 19 times. Never widened. Performed 7409 root evaluator evaluations with a maximum evaluation depth of 23. Performed 7409 inverse root evaluator evaluations with a maximum inverse evaluation depth of 23. Found 5 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-03 03:10:34,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:10:34,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:10:34,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:10:34,124 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/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-03 03:10:34,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:10:34,130 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:10:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:10:34,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:10:34,531 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_112 Int)) (let ((.cse0 (mod (+ v_prenex_112 69157) 299861))) (and (= .cse0 0) (<= |c_old(~a29~0)| v_prenex_112) (<= c_~a29~0 (+ .cse0 300138))))) (exists ((v_~a29~0_728 Int)) (let ((.cse2 (+ v_~a29~0_728 69157))) (let ((.cse1 (mod .cse2 299861))) (and (not (= .cse1 0)) (< .cse2 0) (<= c_~a29~0 (+ .cse1 277)) (<= |c_old(~a29~0)| v_~a29~0_728))))) (exists ((v_prenex_111 Int)) (let ((.cse3 (+ v_prenex_111 69157))) (and (<= |c_old(~a29~0)| v_prenex_111) (<= 0 .cse3) (<= c_~a29~0 (+ (mod .cse3 299861) 300138)))))) is different from true [2018-12-03 03:10:34,732 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 94 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-12-03 03:10:34,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:10:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 237 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:10:35,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:10:35,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 25 [2018-12-03 03:10:35,198 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:10:35,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 03:10:35,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 03:10:35,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=462, Unknown=1, NotChecked=44, Total=600 [2018-12-03 03:10:35,198 INFO L87 Difference]: Start difference. First operand 38444 states and 42071 transitions. Second operand 20 states. [2018-12-03 03:10:37,284 WARN L180 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 17 [2018-12-03 03:10:40,180 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-03 03:10:46,500 WARN L180 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 11 [2018-12-03 03:10:49,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:10:49,773 INFO L93 Difference]: Finished difference Result 78380 states and 86479 transitions. [2018-12-03 03:10:49,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 03:10:49,774 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 400 [2018-12-03 03:10:49,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:10:49,837 INFO L225 Difference]: With dead ends: 78380 [2018-12-03 03:10:49,837 INFO L226 Difference]: Without dead ends: 42642 [2018-12-03 03:10:49,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 789 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2959 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=1536, Invalid=7769, Unknown=11, NotChecked=190, Total=9506 [2018-12-03 03:10:49,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42642 states. [2018-12-03 03:10:50,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42642 to 40909. [2018-12-03 03:10:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40909 states. [2018-12-03 03:10:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40909 states to 40909 states and 44647 transitions. [2018-12-03 03:10:50,453 INFO L78 Accepts]: Start accepts. Automaton has 40909 states and 44647 transitions. Word has length 400 [2018-12-03 03:10:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:10:50,454 INFO L480 AbstractCegarLoop]: Abstraction has 40909 states and 44647 transitions. [2018-12-03 03:10:50,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 03:10:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 40909 states and 44647 transitions. [2018-12-03 03:10:50,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-12-03 03:10:50,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:10:50,459 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 03:10:50,459 INFO L423 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:10:50,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:10:50,459 INFO L82 PathProgramCache]: Analyzing trace with hash -920905034, now seen corresponding path program 1 times [2018-12-03 03:10:50,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:10:50,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:10:50,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:10:50,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:10:50,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:10:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 03:10:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 03:10:50,570 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 03:10:50,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:10:50 BoogieIcfgContainer [2018-12-03 03:10:50,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 03:10:50,651 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 03:10:50,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 03:10:50,651 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 03:10:50,651 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:05:25" (3/4) ... [2018-12-03 03:10:50,653 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 03:10:50,750 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_39c2d3fc-8b51-4a44-a741-ec71bac3ea3c/bin-2019/utaipan/witness.graphml [2018-12-03 03:10:50,750 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 03:10:50,750 INFO L168 Benchmark]: Toolchain (without parser) took 326493.95 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.8 GB). Free memory was 956.0 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2018-12-03 03:10:50,751 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 03:10:50,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 457.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -144.7 MB). Peak memory consumption was 58.5 MB. Max. memory is 11.5 GB. [2018-12-03 03:10:50,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.95 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-03 03:10:50,751 INFO L168 Benchmark]: Boogie Preprocessor took 52.28 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-03 03:10:50,751 INFO L168 Benchmark]: RCFGBuilder took 917.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 914.9 MB in the end (delta: 172.0 MB). Peak memory consumption was 172.0 MB. Max. memory is 11.5 GB. [2018-12-03 03:10:50,751 INFO L168 Benchmark]: TraceAbstraction took 324938.17 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 914.9 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-12-03 03:10:50,752 INFO L168 Benchmark]: Witness Printer took 99.05 ms. Allocated memory is still 4.8 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 72.9 MB). Peak memory consumption was 72.9 MB. Max. memory is 11.5 GB. [2018-12-03 03:10:50,753 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 457.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -144.7 MB). Peak memory consumption was 58.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.95 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.28 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 917.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 914.9 MB in the end (delta: 172.0 MB). Peak memory consumption was 172.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 324938.17 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 914.9 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 99.05 ms. Allocated memory is still 4.8 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 72.9 MB). Peak memory consumption was 72.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 30]: 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=6, 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)=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, 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)=6, a23=312, a25=13, a29=206675, a3=1, a4=1, a8=15, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND TRUE (((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)) [L234] a29 = ((((a29 / 5) - -25349) / 5) + 110879) [L235] a23 = ((((((a23 * 9)/ 10) + 1944) + 57035) % 90)- -48) [L236] a4 = 1 [L237] a25 = 9 [L239] return -1; VAL [\old(a23)=312, \old(a25)=13, \old(a29)=206675, \old(a4)=1, \old(input)=6, \result=-1, a23=87, a25=9, a29=124215, a3=1, a4=1, a8=15, input=6, 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=87, a25=9, a29=124215, a3=1, a4=1, a8=15, calculate_output(input)=-1, input=6, 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=87, a25=9, a29=124215, 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)=87, \old(a25)=9, \old(a29)=124215, \old(a4)=1, \old(input)=1, a23=87, a25=9, a29=124215, 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)=87, \old(a25)=9, \old(a29)=124215, \old(a4)=1, \old(input)=1, a23=87, a25=9, a29=124215, a3=1, a4=1, a8=15, input=1, 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)=87, \old(a25)=9, \old(a29)=124215, \old(a4)=1, \old(input)=1, a23=87, a25=9, a29=124215, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L29] COND TRUE ((((( 277 < a29 && (a4==1)) && (a25==9)) && (a3==1)) && ((-43 < a23) && (138 >= a23)) ) && (a8==15)) VAL [\old(a23)=87, \old(a25)=9, \old(a29)=124215, \old(a4)=1, \old(input)=1, a23=87, a25=9, a29=124215, a3=1, a4=1, a8=15, input=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] __VERIFIER_error() VAL [\old(a23)=87, \old(a25)=9, \old(a29)=124215, \old(a4)=1, \old(input)=1, a23=87, a25=9, a29=124215, 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, 324.8s OverallTime, 22 OverallIterations, 5 TraceHistogramMax, 286.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2872 SDtfs, 41578 SDslu, 5505 SDs, 0 SdLazy, 73243 SolverSat, 18375 SolverUnsat, 62 SolverUnknown, 0 SolverNotchecked, 195.7s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 8696 GetRequests, 7776 SyntacticMatches, 31 SemanticMatches, 889 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29828 ImplicationChecksByTransitivity, 81.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44444occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 10.2s AbstIntTime, 14 AbstIntIterations, 2 AbstIntStrong, 0.9972338087124797 AbsIntWeakeningRatio, 0.15723270440251572 AbsIntAvgWeakeningVarsNumRemoved, 17.462264150943398 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 6.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 29928 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 9525 NumberOfCodeBlocks, 9525 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 12765 ConstructedInterpolants, 37 QuantifiedInterpolants, 26010431 SizeOfPredicates, 39 NumberOfNonLiveVariables, 6574 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 45 InterpolantComputations, 8 PerfectInterpolantSequences, 7338/10013 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...