./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label29_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ae0e546b-837a-4f19-bc1b-617dfa8fe107/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ae0e546b-837a-4f19-bc1b-617dfa8fe107/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ae0e546b-837a-4f19-bc1b-617dfa8fe107/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ae0e546b-837a-4f19-bc1b-617dfa8fe107/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label29_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ae0e546b-837a-4f19-bc1b-617dfa8fe107/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ae0e546b-837a-4f19-bc1b-617dfa8fe107/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 0fc5590477f6549e81dc2878d34d88f93c806480 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-5842f4b [2018-11-18 16:05:09,498 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:05:09,499 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:05:09,505 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:05:09,505 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:05:09,505 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:05:09,506 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:05:09,507 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:05:09,509 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:05:09,509 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:05:09,510 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:05:09,510 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:05:09,511 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:05:09,511 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:05:09,512 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:05:09,513 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:05:09,513 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:05:09,514 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:05:09,516 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:05:09,517 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:05:09,517 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:05:09,518 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:05:09,520 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:05:09,520 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:05:09,520 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:05:09,521 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:05:09,521 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:05:09,522 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:05:09,523 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:05:09,523 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:05:09,523 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:05:09,524 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:05:09,524 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:05:09,524 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:05:09,525 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:05:09,525 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:05:09,526 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ae0e546b-837a-4f19-bc1b-617dfa8fe107/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 16:05:09,534 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:05:09,534 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:05:09,535 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:05:09,535 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 16:05:09,535 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 16:05:09,535 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 16:05:09,535 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 16:05:09,535 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 16:05:09,535 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 16:05:09,536 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 16:05:09,536 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 16:05:09,536 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 16:05:09,536 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 16:05:09,536 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:05:09,536 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:05:09,537 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:05:09,537 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:05:09,537 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:05:09,537 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:05:09,537 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:05:09,537 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:05:09,537 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:05:09,537 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:05:09,537 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:05:09,538 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:05:09,538 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:05:09,538 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:05:09,538 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:05:09,538 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:05:09,538 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:05:09,538 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:05:09,539 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:05:09,539 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:05:09,539 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 16:05:09,539 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:05:09,539 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:05:09,539 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 16:05:09,539 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_ae0e546b-837a-4f19-bc1b-617dfa8fe107/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 -> 0fc5590477f6549e81dc2878d34d88f93c806480 [2018-11-18 16:05:09,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:05:09,569 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:05:09,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:05:09,572 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:05:09,572 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:05:09,573 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ae0e546b-837a-4f19-bc1b-617dfa8fe107/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label29_false-unreach-call.c [2018-11-18 16:05:09,607 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ae0e546b-837a-4f19-bc1b-617dfa8fe107/bin-2019/utaipan/data/b3f2c992a/743c4f4f67ba4131a7721917ec6d4280/FLAGcb1a142ef [2018-11-18 16:05:10,045 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:05:10,046 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ae0e546b-837a-4f19-bc1b-617dfa8fe107/sv-benchmarks/c/eca-rers2012/Problem10_label29_false-unreach-call.c [2018-11-18 16:05:10,055 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ae0e546b-837a-4f19-bc1b-617dfa8fe107/bin-2019/utaipan/data/b3f2c992a/743c4f4f67ba4131a7721917ec6d4280/FLAGcb1a142ef [2018-11-18 16:05:10,067 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ae0e546b-837a-4f19-bc1b-617dfa8fe107/bin-2019/utaipan/data/b3f2c992a/743c4f4f67ba4131a7721917ec6d4280 [2018-11-18 16:05:10,069 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:05:10,070 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:05:10,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:05:10,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:05:10,074 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:05:10,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:05:10" (1/1) ... [2018-11-18 16:05:10,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f427c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:05:10, skipping insertion in model container [2018-11-18 16:05:10,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:05:10" (1/1) ... [2018-11-18 16:05:10,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:05:10,118 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:05:10,327 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:05:10,329 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:05:10,393 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:05:10,405 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:05:10,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:05:10 WrapperNode [2018-11-18 16:05:10,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:05:10,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:05:10,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:05:10,406 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:05:10,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:05:10" (1/1) ... [2018-11-18 16:05:10,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:05:10" (1/1) ... [2018-11-18 16:05:10,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:05:10,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:05:10,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:05:10,485 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:05:10,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:05:10" (1/1) ... [2018-11-18 16:05:10,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:05:10" (1/1) ... [2018-11-18 16:05:10,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:05:10" (1/1) ... [2018-11-18 16:05:10,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:05:10" (1/1) ... [2018-11-18 16:05:10,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:05:10" (1/1) ... [2018-11-18 16:05:10,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:05:10" (1/1) ... [2018-11-18 16:05:10,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:05:10" (1/1) ... [2018-11-18 16:05:10,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:05:10,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:05:10,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:05:10,534 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:05:10,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:05:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae0e546b-837a-4f19-bc1b-617dfa8fe107/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-11-18 16:05:10,577 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 16:05:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:05:10,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:05:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-18 16:05:10,578 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-18 16:05:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:05:10,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:05:10,578 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:05:10,578 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:05:11,308 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:05:11,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:05:11 BoogieIcfgContainer [2018-11-18 16:05:11,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:05:11,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:05:11,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:05:11,312 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:05:11,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:05:10" (1/3) ... [2018-11-18 16:05:11,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25585ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:05:11, skipping insertion in model container [2018-11-18 16:05:11,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:05:10" (2/3) ... [2018-11-18 16:05:11,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25585ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:05:11, skipping insertion in model container [2018-11-18 16:05:11,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:05:11" (3/3) ... [2018-11-18 16:05:11,314 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label29_false-unreach-call.c [2018-11-18 16:05:11,320 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:05:11,325 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:05:11,334 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:05:11,356 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:05:11,356 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:05:11,356 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:05:11,356 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:05:11,356 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:05:11,356 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:05:11,357 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:05:11,357 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:05:11,373 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-18 16:05:11,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 16:05:11,378 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:05:11,378 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:05:11,380 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:05:11,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:05:11,383 INFO L82 PathProgramCache]: Analyzing trace with hash -246853596, now seen corresponding path program 1 times [2018-11-18 16:05:11,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:05:11,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:11,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:05:11,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:11,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:05:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:05:11,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:05:11,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:05:11,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:05:11,557 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:05:11,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:05:11,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:05:11,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:05:11,570 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-18 16:05:12,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:05:12,136 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-18 16:05:12,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:05:12,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 16:05:12,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:05:12,150 INFO L225 Difference]: With dead ends: 574 [2018-11-18 16:05:12,150 INFO L226 Difference]: Without dead ends: 356 [2018-11-18 16:05:12,154 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:05:12,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-18 16:05:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-18 16:05:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-18 16:05:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-11-18 16:05:12,202 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 22 [2018-11-18 16:05:12,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:05:12,203 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-11-18 16:05:12,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:05:12,203 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-11-18 16:05:12,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 16:05:12,206 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:05:12,207 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:05:12,208 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:05:12,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:05:12,208 INFO L82 PathProgramCache]: Analyzing trace with hash -409159749, now seen corresponding path program 1 times [2018-11-18 16:05:12,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:05:12,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:12,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:05:12,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:12,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:05:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:05:12,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:05:12,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:05:12,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:05:12,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:05:12,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:05:12,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:05:12,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:05:12,365 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 5 states. [2018-11-18 16:05:13,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:05:13,188 INFO L93 Difference]: Finished difference Result 1287 states and 2312 transitions. [2018-11-18 16:05:13,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 16:05:13,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-11-18 16:05:13,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:05:13,194 INFO L225 Difference]: With dead ends: 1287 [2018-11-18 16:05:13,195 INFO L226 Difference]: Without dead ends: 937 [2018-11-18 16:05:13,198 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:05:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2018-11-18 16:05:13,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 924. [2018-11-18 16:05:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2018-11-18 16:05:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1441 transitions. [2018-11-18 16:05:13,233 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1441 transitions. Word has length 105 [2018-11-18 16:05:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:05:13,233 INFO L480 AbstractCegarLoop]: Abstraction has 924 states and 1441 transitions. [2018-11-18 16:05:13,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:05:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1441 transitions. [2018-11-18 16:05:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 16:05:13,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:05:13,236 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:05:13,236 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:05:13,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:05:13,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1170323611, now seen corresponding path program 1 times [2018-11-18 16:05:13,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:05:13,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:13,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:05:13,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:13,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:05:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:05:13,367 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:05:13,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:05:13,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 16:05:13,368 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:05:13,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:05:13,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:05:13,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:05:13,369 INFO L87 Difference]: Start difference. First operand 924 states and 1441 transitions. Second operand 6 states. [2018-11-18 16:05:14,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:05:14,137 INFO L93 Difference]: Finished difference Result 2533 states and 4079 transitions. [2018-11-18 16:05:14,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:05:14,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-11-18 16:05:14,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:05:14,144 INFO L225 Difference]: With dead ends: 2533 [2018-11-18 16:05:14,144 INFO L226 Difference]: Without dead ends: 1615 [2018-11-18 16:05:14,148 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:05:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2018-11-18 16:05:14,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1584. [2018-11-18 16:05:14,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2018-11-18 16:05:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2317 transitions. [2018-11-18 16:05:14,176 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2317 transitions. Word has length 121 [2018-11-18 16:05:14,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:05:14,176 INFO L480 AbstractCegarLoop]: Abstraction has 1584 states and 2317 transitions. [2018-11-18 16:05:14,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:05:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2317 transitions. [2018-11-18 16:05:14,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-18 16:05:14,179 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:05:14,180 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:05:14,180 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:05:14,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:05:14,180 INFO L82 PathProgramCache]: Analyzing trace with hash -367068693, now seen corresponding path program 1 times [2018-11-18 16:05:14,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:05:14,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:14,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:05:14,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:14,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:05:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:05:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:05:14,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:05:14,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 16:05:14,305 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:05:14,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:05:14,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:05:14,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:05:14,306 INFO L87 Difference]: Start difference. First operand 1584 states and 2317 transitions. Second operand 6 states. [2018-11-18 16:05:14,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:05:14,826 INFO L93 Difference]: Finished difference Result 3502 states and 5313 transitions. [2018-11-18 16:05:14,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:05:14,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2018-11-18 16:05:14,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:05:14,832 INFO L225 Difference]: With dead ends: 3502 [2018-11-18 16:05:14,833 INFO L226 Difference]: Without dead ends: 1924 [2018-11-18 16:05:14,835 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:05:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2018-11-18 16:05:14,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1885. [2018-11-18 16:05:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1885 states. [2018-11-18 16:05:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2678 transitions. [2018-11-18 16:05:14,866 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2678 transitions. Word has length 145 [2018-11-18 16:05:14,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:05:14,867 INFO L480 AbstractCegarLoop]: Abstraction has 1885 states and 2678 transitions. [2018-11-18 16:05:14,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:05:14,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2678 transitions. [2018-11-18 16:05:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-18 16:05:14,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:05:14,870 INFO L375 BasicCegarLoop]: trace histogram [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-11-18 16:05:14,870 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:05:14,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:05:14,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1267702892, now seen corresponding path program 1 times [2018-11-18 16:05:14,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:05:14,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:14,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:05:14,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:14,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:05:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:05:14,967 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 99 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:05:14,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:05:14,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:05:14,968 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 177 with the following transitions: [2018-11-18 16:05:14,969 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [77], [79], [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], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-18 16:05:14,997 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:05:14,998 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:05:15,507 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:05:15,508 INFO L272 AbstractInterpreter]: Visited 92 different actions 352 times. Merged at 7 different actions 20 times. Never widened. Performed 3349 root evaluator evaluations with a maximum evaluation depth of 16. Performed 3349 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-18 16:05:15,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:05:15,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:05:15,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:05:15,526 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae0e546b-837a-4f19-bc1b-617dfa8fe107/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-11-18 16:05:15,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:05:15,533 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:05:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:05:15,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:05:15,639 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 99 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:05:15,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:05:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 99 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:05:15,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:05:15,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-18 16:05:15,728 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:05:15,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 16:05:15,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 16:05:15,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-18 16:05:15,729 INFO L87 Difference]: Start difference. First operand 1885 states and 2678 transitions. Second operand 9 states. [2018-11-18 16:05:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:05:16,984 INFO L93 Difference]: Finished difference Result 5485 states and 8955 transitions. [2018-11-18 16:05:16,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 16:05:16,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 176 [2018-11-18 16:05:16,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:05:17,001 INFO L225 Difference]: With dead ends: 5485 [2018-11-18 16:05:17,001 INFO L226 Difference]: Without dead ends: 3606 [2018-11-18 16:05:17,013 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 355 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2018-11-18 16:05:17,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2018-11-18 16:05:17,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 3516. [2018-11-18 16:05:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3516 states. [2018-11-18 16:05:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3516 states to 3516 states and 4915 transitions. [2018-11-18 16:05:17,084 INFO L78 Accepts]: Start accepts. Automaton has 3516 states and 4915 transitions. Word has length 176 [2018-11-18 16:05:17,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:05:17,084 INFO L480 AbstractCegarLoop]: Abstraction has 3516 states and 4915 transitions. [2018-11-18 16:05:17,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 16:05:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 3516 states and 4915 transitions. [2018-11-18 16:05:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-18 16:05:17,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:05:17,090 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:05:17,090 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:05:17,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:05:17,090 INFO L82 PathProgramCache]: Analyzing trace with hash -249380893, now seen corresponding path program 1 times [2018-11-18 16:05:17,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:05:17,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:17,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:05:17,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:17,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:05:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:05:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 106 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:05:17,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:05:17,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:05:17,200 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2018-11-18 16:05:17,200 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [77], [79], [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], [526], [527], [531], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-18 16:05:17,203 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:05:17,203 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:05:17,293 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 16:05:17,293 INFO L272 AbstractInterpreter]: Visited 88 different actions 88 times. Never merged. Never widened. Performed 772 root evaluator evaluations with a maximum evaluation depth of 14. Performed 772 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Never found a fixpoint. Largest state had 24 variables. [2018-11-18 16:05:17,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:05:17,297 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 16:05:17,542 INFO L227 lantSequenceWeakener]: Weakened 174 states. On average, predicates are now at 72.77% of their original sizes. [2018-11-18 16:05:17,543 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 16:05:17,577 INFO L415 sIntCurrentIteration]: We unified 182 AI predicates to 182 [2018-11-18 16:05:17,577 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 16:05:17,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:05:17,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-18 16:05:17,578 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:05:17,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:05:17,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:05:17,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:05:17,579 INFO L87 Difference]: Start difference. First operand 3516 states and 4915 transitions. Second operand 6 states. [2018-11-18 16:05:26,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:05:26,576 INFO L93 Difference]: Finished difference Result 7172 states and 10022 transitions. [2018-11-18 16:05:26,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:05:26,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2018-11-18 16:05:26,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:05:26,591 INFO L225 Difference]: With dead ends: 7172 [2018-11-18 16:05:26,592 INFO L226 Difference]: Without dead ends: 3662 [2018-11-18 16:05:26,615 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 183 GetRequests, 178 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-11-18 16:05:26,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2018-11-18 16:05:26,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3660. [2018-11-18 16:05:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3660 states. [2018-11-18 16:05:26,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3660 states to 3660 states and 5066 transitions. [2018-11-18 16:05:26,705 INFO L78 Accepts]: Start accepts. Automaton has 3660 states and 5066 transitions. Word has length 183 [2018-11-18 16:05:26,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:05:26,705 INFO L480 AbstractCegarLoop]: Abstraction has 3660 states and 5066 transitions. [2018-11-18 16:05:26,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:05:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3660 states and 5066 transitions. [2018-11-18 16:05:26,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-18 16:05:26,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:05:26,715 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:05:26,715 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:05:26,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:05:26,716 INFO L82 PathProgramCache]: Analyzing trace with hash -684952785, now seen corresponding path program 1 times [2018-11-18 16:05:26,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:05:26,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:26,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:05:26,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:26,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:05:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:05:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 51 proven. 154 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-18 16:05:26,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:05:26,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:05:26,903 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 264 with the following transitions: [2018-11-18 16:05:26,903 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [77], [79], [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], [526], [527], [531], [534], [535], [539], [543], [546], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-18 16:05:26,905 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:05:26,905 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:05:27,218 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:05:27,219 INFO L272 AbstractInterpreter]: Visited 93 different actions 277 times. Merged at 8 different actions 21 times. Never widened. Performed 2629 root evaluator evaluations with a maximum evaluation depth of 16. Performed 2629 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-18 16:05:27,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:05:27,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:05:27,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:05:27,229 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae0e546b-837a-4f19-bc1b-617dfa8fe107/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-11-18 16:05:27,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:05:27,235 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:05:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:05:27,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:05:27,346 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 263 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 16:05:27,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:05:27,423 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 126 proven. 77 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-18 16:05:27,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:05:27,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-18 16:05:27,439 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:05:27,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 16:05:27,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 16:05:27,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:05:27,440 INFO L87 Difference]: Start difference. First operand 3660 states and 5066 transitions. Second operand 11 states. [2018-11-18 16:05:29,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:05:29,104 INFO L93 Difference]: Finished difference Result 10624 states and 15926 transitions. [2018-11-18 16:05:29,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 16:05:29,104 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 263 [2018-11-18 16:05:29,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:05:29,115 INFO L225 Difference]: With dead ends: 10624 [2018-11-18 16:05:29,115 INFO L226 Difference]: Without dead ends: 2995 [2018-11-18 16:05:29,161 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 533 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-11-18 16:05:29,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2018-11-18 16:05:29,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2507. [2018-11-18 16:05:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2018-11-18 16:05:29,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3140 transitions. [2018-11-18 16:05:29,226 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3140 transitions. Word has length 263 [2018-11-18 16:05:29,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:05:29,226 INFO L480 AbstractCegarLoop]: Abstraction has 2507 states and 3140 transitions. [2018-11-18 16:05:29,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 16:05:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3140 transitions. [2018-11-18 16:05:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-11-18 16:05:29,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:05:29,231 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 16:05:29,232 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:05:29,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:05:29,232 INFO L82 PathProgramCache]: Analyzing trace with hash -848511049, now seen corresponding path program 1 times [2018-11-18 16:05:29,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:05:29,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:29,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:05:29,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:29,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:05:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:05:29,383 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 207 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-18 16:05:29,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:05:29,384 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:05:29,384 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 300 with the following transitions: [2018-11-18 16:05:29,384 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [77], [79], [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], [526], [527], [531], [535], [539], [543], [546], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-18 16:05:29,387 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:05:29,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:05:29,747 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:05:29,747 INFO L272 AbstractInterpreter]: Visited 126 different actions 375 times. Merged at 8 different actions 21 times. Never widened. Performed 3890 root evaluator evaluations with a maximum evaluation depth of 16. Performed 3890 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-18 16:05:29,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:05:29,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:05:29,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:05:29,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae0e546b-837a-4f19-bc1b-617dfa8fe107/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-11-18 16:05:29,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:05:29,755 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:05:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:05:29,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:05:29,885 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 207 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-18 16:05:29,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:05:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 207 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-18 16:05:30,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:05:30,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-11-18 16:05:30,029 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:05:30,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 16:05:30,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 16:05:30,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:05:30,031 INFO L87 Difference]: Start difference. First operand 2507 states and 3140 transitions. Second operand 9 states. [2018-11-18 16:05:30,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:05:30,877 INFO L93 Difference]: Finished difference Result 4738 states and 5990 transitions. [2018-11-18 16:05:30,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 16:05:30,878 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 299 [2018-11-18 16:05:30,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:05:30,887 INFO L225 Difference]: With dead ends: 4738 [2018-11-18 16:05:30,887 INFO L226 Difference]: Without dead ends: 2381 [2018-11-18 16:05:30,892 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 600 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-18 16:05:30,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2018-11-18 16:05:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2291. [2018-11-18 16:05:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2018-11-18 16:05:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 2626 transitions. [2018-11-18 16:05:30,948 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 2626 transitions. Word has length 299 [2018-11-18 16:05:30,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:05:30,949 INFO L480 AbstractCegarLoop]: Abstraction has 2291 states and 2626 transitions. [2018-11-18 16:05:30,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 16:05:30,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 2626 transitions. [2018-11-18 16:05:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-11-18 16:05:30,954 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:05:30,955 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-18 16:05:30,955 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:05:30,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:05:30,955 INFO L82 PathProgramCache]: Analyzing trace with hash -873441429, now seen corresponding path program 1 times [2018-11-18 16:05:30,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:05:30,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:30,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:05:30,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:30,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:05:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:05:31,168 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-11-18 16:05:31,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:05:31,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:05:31,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:05:31,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:05:31,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:05:31,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:05:31,173 INFO L87 Difference]: Start difference. First operand 2291 states and 2626 transitions. Second operand 4 states. [2018-11-18 16:05:31,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:05:31,642 INFO L93 Difference]: Finished difference Result 5011 states and 5829 transitions. [2018-11-18 16:05:31,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:05:31,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2018-11-18 16:05:31,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:05:31,647 INFO L225 Difference]: With dead ends: 5011 [2018-11-18 16:05:31,647 INFO L226 Difference]: Without dead ends: 2671 [2018-11-18 16:05:31,650 INFO L604 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-11-18 16:05:31,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2018-11-18 16:05:31,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 2379. [2018-11-18 16:05:31,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2379 states. [2018-11-18 16:05:31,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 2707 transitions. [2018-11-18 16:05:31,692 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 2707 transitions. Word has length 309 [2018-11-18 16:05:31,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:05:31,692 INFO L480 AbstractCegarLoop]: Abstraction has 2379 states and 2707 transitions. [2018-11-18 16:05:31,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:05:31,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 2707 transitions. [2018-11-18 16:05:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-11-18 16:05:31,698 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:05:31,698 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 16:05:31,698 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:05:31,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:05:31,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1747302249, now seen corresponding path program 1 times [2018-11-18 16:05:31,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:05:31,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:31,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:05:31,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:31,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:05:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:05:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 51 proven. 241 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 16:05:32,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:05:32,009 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 16:05:32,009 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 316 with the following transitions: [2018-11-18 16:05:32,010 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [77], [79], [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], [526], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [610], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-18 16:05:32,012 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 16:05:32,012 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 16:05:32,201 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 16:05:32,201 INFO L272 AbstractInterpreter]: Visited 126 different actions 375 times. Merged at 8 different actions 21 times. Never widened. Performed 3903 root evaluator evaluations with a maximum evaluation depth of 14. Performed 3903 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-18 16:05:32,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:05:32,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 16:05:32,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:05:32,205 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae0e546b-837a-4f19-bc1b-617dfa8fe107/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-11-18 16:05:32,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:05:32,212 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 16:05:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:05:32,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:05:43,175 WARN L180 SmtUtils]: Spent 10.80 s on a formula simplification. DAG size of input: 90 DAG size of output: 47 [2018-11-18 16:05:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 282 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 16:05:43,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:05:43,606 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:43,687 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 118 [2018-11-18 16:05:44,355 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,358 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,360 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,363 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,365 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,368 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,371 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,374 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,378 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,380 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,382 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,384 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,386 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,388 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,390 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,392 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,394 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,395 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,397 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,399 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,401 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,403 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,405 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,407 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,409 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,411 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,413 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,415 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,417 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,420 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,422 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,424 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,426 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,428 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,430 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,431 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,433 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,435 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,437 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,439 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,441 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,443 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,445 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,447 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,449 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,451 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,453 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,455 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,457 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,460 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,462 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,464 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,466 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,468 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,469 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,472 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,474 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,477 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,479 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,481 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,483 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,484 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,487 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,489 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,490 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,492 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,494 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,496 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,498 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,499 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,501 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,503 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,505 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,507 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,508 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,510 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,512 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,513 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,515 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,517 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,519 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,520 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,522 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,524 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,526 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,527 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,529 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,531 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,533 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,535 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,536 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,538 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,540 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,542 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,543 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,545 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,547 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,549 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,551 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,553 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,555 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,557 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,559 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,560 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,562 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,564 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,566 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:44,567 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 16:05:45,073 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 51 proven. 244 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 16:05:45,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 16:05:45,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2018-11-18 16:05:45,089 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 16:05:45,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 16:05:45,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 16:05:45,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-11-18 16:05:45,090 INFO L87 Difference]: Start difference. First operand 2379 states and 2707 transitions. Second operand 16 states. [2018-11-18 16:05:56,668 WARN L180 SmtUtils]: Spent 6.19 s on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2018-11-18 16:05:57,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:05:57,948 INFO L93 Difference]: Finished difference Result 6404 states and 7662 transitions. [2018-11-18 16:05:57,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-18 16:05:57,948 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 315 [2018-11-18 16:05:57,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:05:57,959 INFO L225 Difference]: With dead ends: 6404 [2018-11-18 16:05:57,959 INFO L226 Difference]: Without dead ends: 4175 [2018-11-18 16:05:57,964 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 639 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=460, Invalid=1702, Unknown=0, NotChecked=0, Total=2162 [2018-11-18 16:05:57,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4175 states. [2018-11-18 16:05:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4175 to 3828. [2018-11-18 16:05:58,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3828 states. [2018-11-18 16:05:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 3828 states and 4471 transitions. [2018-11-18 16:05:58,044 INFO L78 Accepts]: Start accepts. Automaton has 3828 states and 4471 transitions. Word has length 315 [2018-11-18 16:05:58,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:05:58,044 INFO L480 AbstractCegarLoop]: Abstraction has 3828 states and 4471 transitions. [2018-11-18 16:05:58,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 16:05:58,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3828 states and 4471 transitions. [2018-11-18 16:05:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-11-18 16:05:58,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:05:58,053 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:05:58,053 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:05:58,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:05:58,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1322528308, now seen corresponding path program 1 times [2018-11-18 16:05:58,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:05:58,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:58,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:05:58,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:05:58,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:05:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:05:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:05:58,196 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 16:05:58,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:05:58 BoogieIcfgContainer [2018-11-18 16:05:58,289 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:05:58,289 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:05:58,290 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:05:58,290 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:05:58,290 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:05:11" (3/4) ... [2018-11-18 16:05:58,293 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 16:05:58,430 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ae0e546b-837a-4f19-bc1b-617dfa8fe107/bin-2019/utaipan/witness.graphml [2018-11-18 16:05:58,431 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:05:58,431 INFO L168 Benchmark]: Toolchain (without parser) took 48361.97 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 951.2 MB in the beginning and 1.9 GB in the end (delta: -922.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-18 16:05:58,432 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:05:58,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.87 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 921.7 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:05:58,432 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 919.0 MB in the beginning and 1.1 GB in the end (delta: -210.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-11-18 16:05:58,432 INFO L168 Benchmark]: Boogie Preprocessor took 48.05 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:05:58,433 INFO L168 Benchmark]: RCFGBuilder took 775.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.4 MB). Peak memory consumption was 103.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:05:58,433 INFO L168 Benchmark]: TraceAbstraction took 46979.67 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -896.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-18 16:05:58,433 INFO L168 Benchmark]: Witness Printer took 141.18 ms. Allocated memory is still 3.2 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2018-11-18 16:05:58,434 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 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 334.87 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 921.7 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 919.0 MB in the beginning and 1.1 GB in the end (delta: -210.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.05 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 775.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.4 MB). Peak memory consumption was 103.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46979.67 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -896.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 141.18 ms. Allocated memory is still 3.2 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 49]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; VAL [\old(a1)=518106, \old(a10)=518110, \old(a12)=518114, \old(a19)=518107, \old(a4)=518111, \old(inputB)=518113, \old(inputC)=518112, \old(inputD)=518108, \old(inputE)=518105, \old(inputF)=518109, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L579] int output = -1; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, a1=23, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L526] COND TRUE ((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0))))) [L527] a1 = (((a1 * 5) + 278443) - -239546) [L528] RET return 26; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=2, \result=26, a1=518104, a10=0, a12=0, a19=9, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, calculate_output(input)=26, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, a1=518104, a10=0, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND TRUE (((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)) [L245] a1 = (((((a1 % 25)- -13) - 42605) / 5) - -8517) [L246] a10 = 3 [L248] RET return 26; VAL [\old(a1)=518104, \old(a10)=0, \old(a19)=9, \old(input)=6, \result=26, a1=0, a10=3, a12=0, a19=9, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, calculate_output(input)=26, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [L590] CALL, EXPR calculate_output(input) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, a1=0, a10=3, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND TRUE (((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14)) [L346] a1 = ((((a1 - 287698) - 189392) % 89)+ 206) [L347] a10 = 2 [L348] a19 = 7 [L350] RET return -1; VAL [\old(a1)=0, \old(a10)=3, \old(a19)=9, \old(input)=5, \result=-1, a1=156, a10=2, a12=0, a19=7, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L590] EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=156, a10=2, a12=0, a19=7, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=26] [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=156, a10=2, a12=0, a19=7, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L590] CALL calculate_output(input) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a1=156, a10=2, a12=0, a19=7, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a1=156, a10=2, a12=0, a19=7, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a1=156, a10=2, a12=0, a19=7, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a1=156, a10=2, a12=0, a19=7, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a1=156, a10=2, a12=0, a19=7, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a1=156, a10=2, a12=0, a19=7, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a1=156, a10=2, a12=0, a19=7, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a1=156, a10=2, a12=0, a19=7, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a1=156, a10=2, a12=0, a19=7, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a1=156, a10=2, a12=0, a19=7, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L48] COND TRUE (((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)) VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a1=156, a10=2, a12=0, a19=7, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] __VERIFIER_error() VAL [\old(a1)=156, \old(a10)=2, \old(a19)=7, \old(input)=2, a1=156, a10=2, a12=0, a19=7, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNSAFE Result, 46.9s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 28.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 886 SDtfs, 7784 SDslu, 1385 SDs, 0 SdLazy, 14890 SolverSat, 2601 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 18.4s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 2461 GetRequests, 2317 SyntacticMatches, 15 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 18.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3828occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.5s AbstIntTime, 5 AbstIntIterations, 1 AbstIntStrong, 0.9969066647638076 AbsIntWeakeningRatio, 0.14285714285714285 AbsIntAvgWeakeningVarsNumRemoved, 15.148351648351648 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 1392 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 3325 NumberOfCodeBlocks, 3325 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4026 ConstructedInterpolants, 126 QuantifiedInterpolants, 6985257 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1864 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 2616/3350 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...