./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.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_9312651a-502a-4087-95bd-4deee5133e28/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9312651a-502a-4087-95bd-4deee5133e28/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9312651a-502a-4087-95bd-4deee5133e28/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9312651a-502a-4087-95bd-4deee5133e28/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9312651a-502a-4087-95bd-4deee5133e28/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9312651a-502a-4087-95bd-4deee5133e28/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 aaa39ce28677c06ea4974c4267a7bbc4385d14ab ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:27:02,085 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:27:02,087 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:27:02,095 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:27:02,096 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:27:02,096 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:27:02,097 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:27:02,098 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:27:02,098 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:27:02,099 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:27:02,099 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:27:02,099 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:27:02,100 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:27:02,100 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:27:02,101 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:27:02,102 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:27:02,102 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:27:02,103 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:27:02,104 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:27:02,105 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:27:02,106 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:27:02,107 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:27:02,109 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:27:02,109 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:27:02,109 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:27:02,110 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:27:02,111 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:27:02,111 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:27:02,112 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:27:02,112 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:27:02,112 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:27:02,113 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:27:02,113 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:27:02,113 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:27:02,114 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:27:02,114 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:27:02,114 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9312651a-502a-4087-95bd-4deee5133e28/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 14:27:02,122 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:27:02,122 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:27:02,123 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 14:27:02,123 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 14:27:02,123 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 14:27:02,123 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 14:27:02,123 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 14:27:02,123 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 14:27:02,123 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 14:27:02,123 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 14:27:02,124 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 14:27:02,124 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 14:27:02,124 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 14:27:02,124 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:27:02,125 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:27:02,125 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:27:02,125 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:27:02,125 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:27:02,125 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 14:27:02,125 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 14:27:02,125 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 14:27:02,125 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:27:02,126 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:27:02,126 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:27:02,126 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 14:27:02,126 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:27:02,126 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:27:02,126 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 14:27:02,126 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 14:27:02,126 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:27:02,127 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:27:02,127 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 14:27:02,127 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 14:27:02,127 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 14:27:02,127 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 14:27:02,127 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 14:27:02,127 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 14:27:02,128 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_9312651a-502a-4087-95bd-4deee5133e28/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 -> aaa39ce28677c06ea4974c4267a7bbc4385d14ab [2018-11-18 14:27:02,156 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:27:02,165 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:27:02,167 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:27:02,168 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:27:02,169 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:27:02,169 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9312651a-502a-4087-95bd-4deee5133e28/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c [2018-11-18 14:27:02,208 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9312651a-502a-4087-95bd-4deee5133e28/bin-2019/utaipan/data/c7df4afd9/bbb0b16a62994d478581dfda04875a9b/FLAG2563eb6a4 [2018-11-18 14:27:02,601 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:27:02,601 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9312651a-502a-4087-95bd-4deee5133e28/sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c [2018-11-18 14:27:02,611 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9312651a-502a-4087-95bd-4deee5133e28/bin-2019/utaipan/data/c7df4afd9/bbb0b16a62994d478581dfda04875a9b/FLAG2563eb6a4 [2018-11-18 14:27:02,971 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9312651a-502a-4087-95bd-4deee5133e28/bin-2019/utaipan/data/c7df4afd9/bbb0b16a62994d478581dfda04875a9b [2018-11-18 14:27:02,973 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:27:02,974 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:27:02,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:27:02,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:27:02,978 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:27:02,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:27:02" (1/1) ... [2018-11-18 14:27:02,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19f35076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:02, skipping insertion in model container [2018-11-18 14:27:02,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:27:02" (1/1) ... [2018-11-18 14:27:02,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:27:03,021 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:27:03,257 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:27:03,261 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:27:03,331 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:27:03,344 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:27:03,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:03 WrapperNode [2018-11-18 14:27:03,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:27:03,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:27:03,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:27:03,346 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:27:03,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:03" (1/1) ... [2018-11-18 14:27:03,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:03" (1/1) ... [2018-11-18 14:27:03,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:27:03,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:27:03,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:27:03,425 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:27:03,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:03" (1/1) ... [2018-11-18 14:27:03,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:03" (1/1) ... [2018-11-18 14:27:03,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:03" (1/1) ... [2018-11-18 14:27:03,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:03" (1/1) ... [2018-11-18 14:27:03,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:03" (1/1) ... [2018-11-18 14:27:03,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:03" (1/1) ... [2018-11-18 14:27:03,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:03" (1/1) ... [2018-11-18 14:27:03,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:27:03,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:27:03,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:27:03,476 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:27:03,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9312651a-502a-4087-95bd-4deee5133e28/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 14:27:03,522 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 14:27:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 14:27:03,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 14:27:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-18 14:27:03,523 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-18 14:27:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:27:03,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:27:03,523 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 14:27:03,524 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 14:27:04,374 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:27:04,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:27:04 BoogieIcfgContainer [2018-11-18 14:27:04,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:27:04,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 14:27:04,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 14:27:04,378 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 14:27:04,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:27:02" (1/3) ... [2018-11-18 14:27:04,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b325f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:27:04, skipping insertion in model container [2018-11-18 14:27:04,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:27:03" (2/3) ... [2018-11-18 14:27:04,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77b325f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:27:04, skipping insertion in model container [2018-11-18 14:27:04,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:27:04" (3/3) ... [2018-11-18 14:27:04,381 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label20_false-unreach-call_false-termination.c [2018-11-18 14:27:04,389 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 14:27:04,395 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 14:27:04,407 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 14:27:04,434 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 14:27:04,434 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 14:27:04,434 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 14:27:04,434 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:27:04,434 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:27:04,434 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 14:27:04,434 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:27:04,435 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 14:27:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-18 14:27:04,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 14:27:04,459 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:27:04,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:27:04,462 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:27:04,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:04,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1836367149, now seen corresponding path program 1 times [2018-11-18 14:27:04,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:27:04,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:04,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:04,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:04,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:27:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:04,768 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 14:27:04,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:27:04,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:27:04,771 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:27:04,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:27:04,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:27:04,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:27:04,789 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-18 14:27:05,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:05,286 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-18 14:27:05,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:27:05,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-11-18 14:27:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:27:05,299 INFO L225 Difference]: With dead ends: 550 [2018-11-18 14:27:05,299 INFO L226 Difference]: Without dead ends: 340 [2018-11-18 14:27:05,303 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 14:27:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-18 14:27:05,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-18 14:27:05,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-18 14:27:05,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-18 14:27:05,347 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 79 [2018-11-18 14:27:05,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:27:05,347 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-18 14:27:05,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:27:05,348 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-18 14:27:05,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 14:27:05,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:27:05,363 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 14:27:05,363 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:27:05,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:05,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1539527022, now seen corresponding path program 1 times [2018-11-18 14:27:05,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:27:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:05,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:05,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:27:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:27:05,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:27:05,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 14:27:05,452 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:27:05,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:27:05,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:27:05,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:27:05,454 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-18 14:27:05,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:05,989 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-18 14:27:05,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 14:27:05,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2018-11-18 14:27:05,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:27:05,993 INFO L225 Difference]: With dead ends: 888 [2018-11-18 14:27:05,993 INFO L226 Difference]: Without dead ends: 554 [2018-11-18 14:27:05,996 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 14:27:05,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-18 14:27:06,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-18 14:27:06,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-18 14:27:06,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-18 14:27:06,024 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 90 [2018-11-18 14:27:06,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:27:06,024 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-18 14:27:06,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:27:06,024 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-18 14:27:06,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 14:27:06,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:27:06,027 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 14:27:06,028 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:27:06,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:06,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1217877146, now seen corresponding path program 1 times [2018-11-18 14:27:06,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:27:06,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:06,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:06,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:06,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:27:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:06,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:27:06,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:27:06,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:27:06,121 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:27:06,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:27:06,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:27:06,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:27:06,122 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 3 states. [2018-11-18 14:27:06,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:06,460 INFO L93 Difference]: Finished difference Result 1530 states and 2434 transitions. [2018-11-18 14:27:06,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:27:06,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-11-18 14:27:06,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:27:06,464 INFO L225 Difference]: With dead ends: 1530 [2018-11-18 14:27:06,464 INFO L226 Difference]: Without dead ends: 997 [2018-11-18 14:27:06,466 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:27:06,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-11-18 14:27:06,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2018-11-18 14:27:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2018-11-18 14:27:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1433 transitions. [2018-11-18 14:27:06,489 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1433 transitions. Word has length 91 [2018-11-18 14:27:06,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:27:06,489 INFO L480 AbstractCegarLoop]: Abstraction has 997 states and 1433 transitions. [2018-11-18 14:27:06,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:27:06,490 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1433 transitions. [2018-11-18 14:27:06,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-18 14:27:06,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:27:06,492 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] [2018-11-18 14:27:06,493 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:27:06,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:06,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1260901286, now seen corresponding path program 1 times [2018-11-18 14:27:06,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:27:06,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:06,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:06,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:06,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:27:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:06,556 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 14:27:06,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:27:06,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:27:06,556 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:27:06,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:27:06,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:27:06,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:27:06,557 INFO L87 Difference]: Start difference. First operand 997 states and 1433 transitions. Second operand 3 states. [2018-11-18 14:27:07,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:07,016 INFO L93 Difference]: Finished difference Result 2877 states and 4284 transitions. [2018-11-18 14:27:07,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:27:07,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-11-18 14:27:07,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:27:07,026 INFO L225 Difference]: With dead ends: 2877 [2018-11-18 14:27:07,027 INFO L226 Difference]: Without dead ends: 1886 [2018-11-18 14:27:07,030 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:27:07,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2018-11-18 14:27:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1886. [2018-11-18 14:27:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2018-11-18 14:27:07,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2689 transitions. [2018-11-18 14:27:07,076 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2689 transitions. Word has length 97 [2018-11-18 14:27:07,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:27:07,077 INFO L480 AbstractCegarLoop]: Abstraction has 1886 states and 2689 transitions. [2018-11-18 14:27:07,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:27:07,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2689 transitions. [2018-11-18 14:27:07,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 14:27:07,080 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:27:07,080 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:27:07,080 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:27:07,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:07,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1827829834, now seen corresponding path program 1 times [2018-11-18 14:27:07,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:27:07,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:07,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:07,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:07,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:27:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:27:07,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:27:07,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 14:27:07,180 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:27:07,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:27:07,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:27:07,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:27:07,181 INFO L87 Difference]: Start difference. First operand 1886 states and 2689 transitions. Second operand 6 states. [2018-11-18 14:27:07,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:07,834 INFO L93 Difference]: Finished difference Result 3816 states and 5597 transitions. [2018-11-18 14:27:07,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 14:27:07,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-11-18 14:27:07,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:27:07,839 INFO L225 Difference]: With dead ends: 3816 [2018-11-18 14:27:07,840 INFO L226 Difference]: Without dead ends: 1936 [2018-11-18 14:27:07,843 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 14:27:07,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2018-11-18 14:27:07,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1885. [2018-11-18 14:27:07,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1885 states. [2018-11-18 14:27:07,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2473 transitions. [2018-11-18 14:27:07,875 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2473 transitions. Word has length 105 [2018-11-18 14:27:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:27:07,875 INFO L480 AbstractCegarLoop]: Abstraction has 1885 states and 2473 transitions. [2018-11-18 14:27:07,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:27:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2473 transitions. [2018-11-18 14:27:07,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-18 14:27:07,877 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:27:07,877 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:27:07,877 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:27:07,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:07,877 INFO L82 PathProgramCache]: Analyzing trace with hash 982006726, now seen corresponding path program 1 times [2018-11-18 14:27:07,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:27:07,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:07,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:07,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:07,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:27:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:07,961 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:27:07,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:27:07,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:27:07,962 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2018-11-18 14:27:07,963 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 14:27:07,991 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:27:07,992 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:27:08,263 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 14:27:08,264 INFO L272 AbstractInterpreter]: Visited 79 different actions 79 times. Never merged. Never widened. Performed 1180 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1180 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-11-18 14:27:08,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:08,277 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 14:27:08,464 INFO L227 lantSequenceWeakener]: Weakened 107 states. On average, predicates are now at 79.67% of their original sizes. [2018-11-18 14:27:08,465 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 14:27:08,498 INFO L415 sIntCurrentIteration]: We unified 112 AI predicates to 112 [2018-11-18 14:27:08,499 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 14:27:08,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:27:08,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-11-18 14:27:08,499 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:27:08,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:27:08,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:27:08,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:27:08,500 INFO L87 Difference]: Start difference. First operand 1885 states and 2473 transitions. Second operand 6 states. [2018-11-18 14:27:11,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:11,149 INFO L93 Difference]: Finished difference Result 3902 states and 5115 transitions. [2018-11-18 14:27:11,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:27:11,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-11-18 14:27:11,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:27:11,157 INFO L225 Difference]: With dead ends: 3902 [2018-11-18 14:27:11,157 INFO L226 Difference]: Without dead ends: 2023 [2018-11-18 14:27:11,161 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 113 GetRequests, 108 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 14:27:11,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2018-11-18 14:27:11,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 2021. [2018-11-18 14:27:11,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2021 states. [2018-11-18 14:27:11,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 2619 transitions. [2018-11-18 14:27:11,234 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 2619 transitions. Word has length 113 [2018-11-18 14:27:11,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:27:11,234 INFO L480 AbstractCegarLoop]: Abstraction has 2021 states and 2619 transitions. [2018-11-18 14:27:11,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:27:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2619 transitions. [2018-11-18 14:27:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-18 14:27:11,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:27:11,237 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:27:11,238 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:27:11,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:11,238 INFO L82 PathProgramCache]: Analyzing trace with hash 368614065, now seen corresponding path program 1 times [2018-11-18 14:27:11,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:27:11,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:11,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:11,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:11,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:27:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:11,295 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:27:11,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:27:11,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:27:11,295 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2018-11-18 14:27:11,296 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 14:27:11,298 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:27:11,299 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:27:11,482 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 14:27:11,482 INFO L272 AbstractInterpreter]: Visited 83 different actions 160 times. Merged at 5 different actions 5 times. Never widened. Performed 2320 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2320 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-18 14:27:11,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:11,485 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 14:27:11,648 INFO L227 lantSequenceWeakener]: Weakened 112 states. On average, predicates are now at 81.09% of their original sizes. [2018-11-18 14:27:11,648 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 14:27:11,723 INFO L415 sIntCurrentIteration]: We unified 114 AI predicates to 114 [2018-11-18 14:27:11,723 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 14:27:11,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:27:11,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-18 14:27:11,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:27:11,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 14:27:11,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 14:27:11,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:27:11,724 INFO L87 Difference]: Start difference. First operand 2021 states and 2619 transitions. Second operand 10 states. [2018-11-18 14:27:14,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:14,881 INFO L93 Difference]: Finished difference Result 4041 states and 5284 transitions. [2018-11-18 14:27:14,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 14:27:14,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2018-11-18 14:27:14,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:27:14,887 INFO L225 Difference]: With dead ends: 4041 [2018-11-18 14:27:14,887 INFO L226 Difference]: Without dead ends: 2162 [2018-11-18 14:27:14,889 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 122 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-18 14:27:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2018-11-18 14:27:14,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 2159. [2018-11-18 14:27:14,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2159 states. [2018-11-18 14:27:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 2773 transitions. [2018-11-18 14:27:14,916 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 2773 transitions. Word has length 115 [2018-11-18 14:27:14,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:27:14,916 INFO L480 AbstractCegarLoop]: Abstraction has 2159 states and 2773 transitions. [2018-11-18 14:27:14,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 14:27:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 2773 transitions. [2018-11-18 14:27:14,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-18 14:27:14,918 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:27:14,919 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:27:14,919 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:27:14,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:14,919 INFO L82 PathProgramCache]: Analyzing trace with hash 538280163, now seen corresponding path program 1 times [2018-11-18 14:27:14,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:27:14,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:14,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:14,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:14,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:27:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:27:14,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:27:14,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:27:14,973 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 118 with the following transitions: [2018-11-18 14:27:14,974 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 14:27:14,976 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:27:14,976 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:27:15,062 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 14:27:15,062 INFO L272 AbstractInterpreter]: Visited 83 different actions 159 times. Merged at 4 different actions 4 times. Never widened. Performed 2437 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2437 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-18 14:27:15,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:15,064 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 14:27:15,158 INFO L227 lantSequenceWeakener]: Weakened 114 states. On average, predicates are now at 81.1% of their original sizes. [2018-11-18 14:27:15,159 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 14:27:15,204 INFO L415 sIntCurrentIteration]: We unified 116 AI predicates to 116 [2018-11-18 14:27:15,204 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 14:27:15,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:27:15,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-18 14:27:15,204 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:27:15,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 14:27:15,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 14:27:15,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:27:15,205 INFO L87 Difference]: Start difference. First operand 2159 states and 2773 transitions. Second operand 10 states. [2018-11-18 14:27:17,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:17,611 INFO L93 Difference]: Finished difference Result 5610 states and 7275 transitions. [2018-11-18 14:27:17,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 14:27:17,611 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 117 [2018-11-18 14:27:17,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:27:17,618 INFO L225 Difference]: With dead ends: 5610 [2018-11-18 14:27:17,619 INFO L226 Difference]: Without dead ends: 2680 [2018-11-18 14:27:17,624 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-11-18 14:27:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2680 states. [2018-11-18 14:27:17,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2680 to 2669. [2018-11-18 14:27:17,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2669 states. [2018-11-18 14:27:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 3224 transitions. [2018-11-18 14:27:17,675 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 3224 transitions. Word has length 117 [2018-11-18 14:27:17,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:27:17,675 INFO L480 AbstractCegarLoop]: Abstraction has 2669 states and 3224 transitions. [2018-11-18 14:27:17,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 14:27:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 3224 transitions. [2018-11-18 14:27:17,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 14:27:17,678 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:27:17,679 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 14:27:17,679 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:27:17,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:17,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1534428207, now seen corresponding path program 1 times [2018-11-18 14:27:17,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:27:17,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:17,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:17,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:17,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:27:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-18 14:27:17,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:27:17,805 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:27:17,805 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2018-11-18 14:27:17,805 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 14:27:17,807 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:27:17,808 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:27:17,999 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 14:27:17,999 INFO L272 AbstractInterpreter]: Visited 83 different actions 244 times. Merged at 7 different actions 17 times. Never widened. Performed 3709 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3709 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-18 14:27:18,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:18,001 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 14:27:18,176 INFO L227 lantSequenceWeakener]: Weakened 152 states. On average, predicates are now at 82.75% of their original sizes. [2018-11-18 14:27:18,176 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 14:27:18,255 INFO L415 sIntCurrentIteration]: We unified 154 AI predicates to 154 [2018-11-18 14:27:18,255 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 14:27:18,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:27:18,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-11-18 14:27:18,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:27:18,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 14:27:18,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 14:27:18,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:27:18,256 INFO L87 Difference]: Start difference. First operand 2669 states and 3224 transitions. Second operand 10 states. [2018-11-18 14:27:21,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:21,242 INFO L93 Difference]: Finished difference Result 6213 states and 7693 transitions. [2018-11-18 14:27:21,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 14:27:21,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2018-11-18 14:27:21,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:27:21,248 INFO L225 Difference]: With dead ends: 6213 [2018-11-18 14:27:21,248 INFO L226 Difference]: Without dead ends: 3824 [2018-11-18 14:27:21,252 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 163 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-18 14:27:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3824 states. [2018-11-18 14:27:21,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3824 to 3817. [2018-11-18 14:27:21,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3817 states. [2018-11-18 14:27:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3817 states to 3817 states and 4549 transitions. [2018-11-18 14:27:21,296 INFO L78 Accepts]: Start accepts. Automaton has 3817 states and 4549 transitions. Word has length 155 [2018-11-18 14:27:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:27:21,296 INFO L480 AbstractCegarLoop]: Abstraction has 3817 states and 4549 transitions. [2018-11-18 14:27:21,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 14:27:21,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3817 states and 4549 transitions. [2018-11-18 14:27:21,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-18 14:27:21,299 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:27:21,300 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:27:21,300 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:27:21,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:21,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1355415521, now seen corresponding path program 1 times [2018-11-18 14:27:21,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:27:21,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:21,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:21,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:21,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:27:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:21,379 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 92 proven. 48 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 14:27:21,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:27:21,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:27:21,379 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 173 with the following transitions: [2018-11-18 14:27:21,380 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 14:27:21,382 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:27:21,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:27:21,561 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:27:21,562 INFO L272 AbstractInterpreter]: Visited 86 different actions 346 times. Merged at 9 different actions 38 times. Widened at 1 different actions 1 times. Performed 5265 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5265 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-18 14:27:21,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:21,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:27:21,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:27:21,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9312651a-502a-4087-95bd-4deee5133e28/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 14:27:21,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:21,597 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:27:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:21,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:27:21,730 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-18 14:27:21,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:27:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 98 proven. 14 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-18 14:27:21,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:27:21,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-18 14:27:21,821 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:27:21,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 14:27:21,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 14:27:21,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-18 14:27:21,822 INFO L87 Difference]: Start difference. First operand 3817 states and 4549 transitions. Second operand 12 states. [2018-11-18 14:27:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:24,545 INFO L93 Difference]: Finished difference Result 13515 states and 17948 transitions. [2018-11-18 14:27:24,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-18 14:27:24,546 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 172 [2018-11-18 14:27:24,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:27:24,573 INFO L225 Difference]: With dead ends: 13515 [2018-11-18 14:27:24,573 INFO L226 Difference]: Without dead ends: 9978 [2018-11-18 14:27:24,585 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 375 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=479, Invalid=1873, Unknown=0, NotChecked=0, Total=2352 [2018-11-18 14:27:24,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9978 states. [2018-11-18 14:27:24,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9978 to 9412. [2018-11-18 14:27:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9412 states. [2018-11-18 14:27:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9412 states to 9412 states and 12057 transitions. [2018-11-18 14:27:24,742 INFO L78 Accepts]: Start accepts. Automaton has 9412 states and 12057 transitions. Word has length 172 [2018-11-18 14:27:24,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:27:24,742 INFO L480 AbstractCegarLoop]: Abstraction has 9412 states and 12057 transitions. [2018-11-18 14:27:24,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 14:27:24,742 INFO L276 IsEmpty]: Start isEmpty. Operand 9412 states and 12057 transitions. [2018-11-18 14:27:24,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-18 14:27:24,749 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:27:24,749 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:27:24,749 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:27:24,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:24,749 INFO L82 PathProgramCache]: Analyzing trace with hash 872251039, now seen corresponding path program 1 times [2018-11-18 14:27:24,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:27:24,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:24,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:24,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:24,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:27:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 114 proven. 47 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 14:27:24,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:27:24,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:27:24,846 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2018-11-18 14:27:24,846 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 14:27:24,848 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:27:24,848 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:27:24,956 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 14:27:24,956 INFO L272 AbstractInterpreter]: Visited 85 different actions 247 times. Merged at 7 different actions 14 times. Never widened. Performed 3540 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3540 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-18 14:27:24,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:24,964 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 14:27:25,093 INFO L227 lantSequenceWeakener]: Weakened 178 states. On average, predicates are now at 82.87% of their original sizes. [2018-11-18 14:27:25,093 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 14:27:25,145 INFO L415 sIntCurrentIteration]: We unified 180 AI predicates to 180 [2018-11-18 14:27:25,145 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 14:27:25,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:27:25,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-18 14:27:25,145 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:27:25,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 14:27:25,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 14:27:25,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:27:25,146 INFO L87 Difference]: Start difference. First operand 9412 states and 12057 transitions. Second operand 10 states. [2018-11-18 14:27:27,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:27,115 INFO L93 Difference]: Finished difference Result 19377 states and 24781 transitions. [2018-11-18 14:27:27,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 14:27:27,115 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 181 [2018-11-18 14:27:27,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:27:27,136 INFO L225 Difference]: With dead ends: 19377 [2018-11-18 14:27:27,136 INFO L226 Difference]: Without dead ends: 10245 [2018-11-18 14:27:27,152 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 188 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-18 14:27:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10245 states. [2018-11-18 14:27:27,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10245 to 10238. [2018-11-18 14:27:27,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10238 states. [2018-11-18 14:27:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10238 states to 10238 states and 12972 transitions. [2018-11-18 14:27:27,294 INFO L78 Accepts]: Start accepts. Automaton has 10238 states and 12972 transitions. Word has length 181 [2018-11-18 14:27:27,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:27:27,295 INFO L480 AbstractCegarLoop]: Abstraction has 10238 states and 12972 transitions. [2018-11-18 14:27:27,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 14:27:27,295 INFO L276 IsEmpty]: Start isEmpty. Operand 10238 states and 12972 transitions. [2018-11-18 14:27:27,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-18 14:27:27,303 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:27:27,303 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:27:27,303 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:27:27,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:27,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1817263431, now seen corresponding path program 1 times [2018-11-18 14:27:27,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:27:27,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:27,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:27,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:27,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:27:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 181 proven. 47 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 14:27:27,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:27:27,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:27:27,408 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-11-18 14:27:27,408 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [73], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [129], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 14:27:27,409 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:27:27,410 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:27:27,586 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:27:27,586 INFO L272 AbstractInterpreter]: Visited 86 different actions 340 times. Merged at 9 different actions 32 times. Never widened. Performed 5362 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5362 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-18 14:27:27,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:27,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:27:27,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:27:27,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9312651a-502a-4087-95bd-4deee5133e28/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 14:27:27,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:27,607 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:27:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:27,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:27:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-18 14:27:27,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:27:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-18 14:27:27,791 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:27:27,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-18 14:27:27,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:27:27,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:27:27,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:27:27,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:27:27,792 INFO L87 Difference]: Start difference. First operand 10238 states and 12972 transitions. Second operand 3 states. [2018-11-18 14:27:28,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:28,210 INFO L93 Difference]: Finished difference Result 20407 states and 26242 transitions. [2018-11-18 14:27:28,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:27:28,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2018-11-18 14:27:28,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:27:28,252 INFO L225 Difference]: With dead ends: 20407 [2018-11-18 14:27:28,252 INFO L226 Difference]: Without dead ends: 11275 [2018-11-18 14:27:28,317 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 404 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:27:28,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11275 states. [2018-11-18 14:27:28,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11275 to 11245. [2018-11-18 14:27:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11245 states. [2018-11-18 14:27:28,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11245 states to 11245 states and 14131 transitions. [2018-11-18 14:27:28,454 INFO L78 Accepts]: Start accepts. Automaton has 11245 states and 14131 transitions. Word has length 203 [2018-11-18 14:27:28,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:27:28,454 INFO L480 AbstractCegarLoop]: Abstraction has 11245 states and 14131 transitions. [2018-11-18 14:27:28,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:27:28,454 INFO L276 IsEmpty]: Start isEmpty. Operand 11245 states and 14131 transitions. [2018-11-18 14:27:28,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-18 14:27:28,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:27:28,466 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:27:28,466 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:27:28,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:28,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1077200157, now seen corresponding path program 1 times [2018-11-18 14:27:28,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:27:28,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:28,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:28,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:28,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:27:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 199 proven. 61 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 14:27:28,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:27:28,571 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:27:28,571 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-11-18 14:27:28,571 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [129], [130], [134], [137], [138], [142], [145], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 14:27:28,573 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:27:28,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:27:28,745 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:27:28,745 INFO L272 AbstractInterpreter]: Visited 86 different actions 344 times. Merged at 9 different actions 36 times. Widened at 1 different actions 1 times. Performed 5395 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5395 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-18 14:27:28,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:28,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:27:28,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:27:28,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9312651a-502a-4087-95bd-4deee5133e28/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 14:27:28,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:28,765 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:27:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:28,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:27:28,887 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-11-18 14:27:28,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:27:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-11-18 14:27:28,935 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:27:28,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-18 14:27:28,936 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:27:28,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:27:28,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:27:28,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:27:28,936 INFO L87 Difference]: Start difference. First operand 11245 states and 14131 transitions. Second operand 3 states. [2018-11-18 14:27:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:29,279 INFO L93 Difference]: Finished difference Result 26290 states and 33453 transitions. [2018-11-18 14:27:29,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:27:29,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2018-11-18 14:27:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:27:29,309 INFO L225 Difference]: With dead ends: 26290 [2018-11-18 14:27:29,309 INFO L226 Difference]: Without dead ends: 15879 [2018-11-18 14:27:29,331 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 440 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:27:29,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15879 states. [2018-11-18 14:27:29,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15879 to 15692. [2018-11-18 14:27:29,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15692 states. [2018-11-18 14:27:29,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15692 states to 15692 states and 19455 transitions. [2018-11-18 14:27:29,541 INFO L78 Accepts]: Start accepts. Automaton has 15692 states and 19455 transitions. Word has length 221 [2018-11-18 14:27:29,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:27:29,542 INFO L480 AbstractCegarLoop]: Abstraction has 15692 states and 19455 transitions. [2018-11-18 14:27:29,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:27:29,542 INFO L276 IsEmpty]: Start isEmpty. Operand 15692 states and 19455 transitions. [2018-11-18 14:27:29,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-18 14:27:29,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:27:29,555 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-11-18 14:27:29,556 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:27:29,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:29,556 INFO L82 PathProgramCache]: Analyzing trace with hash -695712415, now seen corresponding path program 1 times [2018-11-18 14:27:29,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:27:29,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:29,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:29,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:29,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:27:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:29,659 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 201 proven. 61 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 14:27:29,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:27:29,659 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:27:29,659 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-11-18 14:27:29,659 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [129], [130], [134], [137], [138], [142], [146], [150], [153], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 14:27:29,661 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:27:29,661 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:27:29,841 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:27:29,841 INFO L272 AbstractInterpreter]: Visited 86 different actions 341 times. Merged at 9 different actions 33 times. Never widened. Performed 5335 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5335 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-18 14:27:29,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:29,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:27:29,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:27:29,848 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9312651a-502a-4087-95bd-4deee5133e28/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 14:27:29,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:29,857 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:27:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:29,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:27:29,975 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 219 proven. 2 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-18 14:27:29,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:27:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 175 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-18 14:27:30,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:27:30,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-18 14:27:30,258 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:27:30,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 14:27:30,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 14:27:30,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-18 14:27:30,259 INFO L87 Difference]: Start difference. First operand 15692 states and 19455 transitions. Second operand 12 states. [2018-11-18 14:27:31,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:31,662 INFO L93 Difference]: Finished difference Result 33205 states and 41933 transitions. [2018-11-18 14:27:31,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 14:27:31,662 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 223 [2018-11-18 14:27:31,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:27:31,692 INFO L225 Difference]: With dead ends: 33205 [2018-11-18 14:27:31,692 INFO L226 Difference]: Without dead ends: 16695 [2018-11-18 14:27:31,716 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 14:27:31,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16695 states. [2018-11-18 14:27:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16695 to 16098. [2018-11-18 14:27:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16098 states. [2018-11-18 14:27:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16098 states to 16098 states and 19245 transitions. [2018-11-18 14:27:31,941 INFO L78 Accepts]: Start accepts. Automaton has 16098 states and 19245 transitions. Word has length 223 [2018-11-18 14:27:31,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:27:31,941 INFO L480 AbstractCegarLoop]: Abstraction has 16098 states and 19245 transitions. [2018-11-18 14:27:31,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 14:27:31,941 INFO L276 IsEmpty]: Start isEmpty. Operand 16098 states and 19245 transitions. [2018-11-18 14:27:31,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-18 14:27:31,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:27:31,952 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:27:31,952 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:27:31,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:31,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1952722752, now seen corresponding path program 1 times [2018-11-18 14:27:31,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:27:31,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:31,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:31,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:31,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:27:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:32,070 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 290 proven. 2 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-18 14:27:32,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:27:32,070 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:27:32,070 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 261 with the following transitions: [2018-11-18 14:27:32,070 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [153], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [205], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 14:27:32,072 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:27:32,072 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:27:32,278 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:27:32,278 INFO L272 AbstractInterpreter]: Visited 87 different actions 429 times. Merged at 10 different actions 42 times. Widened at 1 different actions 1 times. Performed 6451 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6451 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 11 fixpoints after 4 different actions. Largest state had 42 variables. [2018-11-18 14:27:32,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:32,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:27:32,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:27:32,279 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9312651a-502a-4087-95bd-4deee5133e28/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:27:32,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:32,285 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:27:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:32,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:27:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 284 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-18 14:27:32,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:27:32,636 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 226 proven. 15 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-11-18 14:27:32,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:27:32,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-18 14:27:32,661 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:27:32,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 14:27:32,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 14:27:32,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-18 14:27:32,662 INFO L87 Difference]: Start difference. First operand 16098 states and 19245 transitions. Second operand 9 states. [2018-11-18 14:27:34,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:34,109 INFO L93 Difference]: Finished difference Result 31255 states and 37619 transitions. [2018-11-18 14:27:34,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-18 14:27:34,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 260 [2018-11-18 14:27:34,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:27:34,136 INFO L225 Difference]: With dead ends: 31255 [2018-11-18 14:27:34,136 INFO L226 Difference]: Without dead ends: 13552 [2018-11-18 14:27:34,164 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 537 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2018-11-18 14:27:34,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13552 states. [2018-11-18 14:27:34,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13552 to 12361. [2018-11-18 14:27:34,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12361 states. [2018-11-18 14:27:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12361 states to 12361 states and 14260 transitions. [2018-11-18 14:27:34,347 INFO L78 Accepts]: Start accepts. Automaton has 12361 states and 14260 transitions. Word has length 260 [2018-11-18 14:27:34,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:27:34,348 INFO L480 AbstractCegarLoop]: Abstraction has 12361 states and 14260 transitions. [2018-11-18 14:27:34,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 14:27:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 12361 states and 14260 transitions. [2018-11-18 14:27:34,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-11-18 14:27:34,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:27:34,361 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:27:34,361 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:27:34,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:34,361 INFO L82 PathProgramCache]: Analyzing trace with hash 683096615, now seen corresponding path program 1 times [2018-11-18 14:27:34,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:27:34,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:34,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:34,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:34,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:27:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 391 proven. 141 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 14:27:35,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:27:35,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:27:35,063 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 302 with the following transitions: [2018-11-18 14:27:35,063 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [89], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [153], [154], [158], [162], [166], [170], [174], [177], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [225], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [269], [271], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 14:27:35,065 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:27:35,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:27:35,281 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:27:35,281 INFO L272 AbstractInterpreter]: Visited 88 different actions 349 times. Merged at 11 different actions 33 times. Never widened. Performed 5311 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5311 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 5 different actions. Largest state had 42 variables. [2018-11-18 14:27:35,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:35,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:27:35,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:27:35,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9312651a-502a-4087-95bd-4deee5133e28/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:27:35,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:35,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:27:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:27:35,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:27:35,546 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 366 proven. 2 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-11-18 14:27:35,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:27:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 366 proven. 2 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-11-18 14:27:35,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:27:35,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5, 5] total 24 [2018-11-18 14:27:35,841 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:27:35,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 14:27:35,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 14:27:35,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2018-11-18 14:27:35,842 INFO L87 Difference]: Start difference. First operand 12361 states and 14260 transitions. Second operand 22 states. [2018-11-18 14:27:41,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:27:41,432 INFO L93 Difference]: Finished difference Result 24587 states and 28416 transitions. [2018-11-18 14:27:41,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-18 14:27:41,432 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 301 [2018-11-18 14:27:41,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:27:41,455 INFO L225 Difference]: With dead ends: 24587 [2018-11-18 14:27:41,456 INFO L226 Difference]: Without dead ends: 13058 [2018-11-18 14:27:41,475 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 646 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2492 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1481, Invalid=6709, Unknown=0, NotChecked=0, Total=8190 [2018-11-18 14:27:41,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13058 states. [2018-11-18 14:27:41,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13058 to 12343. [2018-11-18 14:27:41,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12343 states. [2018-11-18 14:27:41,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12343 states to 12343 states and 13981 transitions. [2018-11-18 14:27:41,619 INFO L78 Accepts]: Start accepts. Automaton has 12343 states and 13981 transitions. Word has length 301 [2018-11-18 14:27:41,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:27:41,620 INFO L480 AbstractCegarLoop]: Abstraction has 12343 states and 13981 transitions. [2018-11-18 14:27:41,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 14:27:41,620 INFO L276 IsEmpty]: Start isEmpty. Operand 12343 states and 13981 transitions. [2018-11-18 14:27:41,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-11-18 14:27:41,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:27:41,631 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:27:41,631 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:27:41,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:27:41,631 INFO L82 PathProgramCache]: Analyzing trace with hash -306271665, now seen corresponding path program 1 times [2018-11-18 14:27:41,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:27:41,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:41,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:27:41,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:27:41,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:27:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:27:41,748 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 14:27:41,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:27:41 BoogieIcfgContainer [2018-11-18 14:27:41,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 14:27:41,837 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:27:41,837 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:27:41,837 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:27:41,837 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:27:04" (3/4) ... [2018-11-18 14:27:41,839 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 14:27:41,951 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9312651a-502a-4087-95bd-4deee5133e28/bin-2019/utaipan/witness.graphml [2018-11-18 14:27:41,951 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:27:41,952 INFO L168 Benchmark]: Toolchain (without parser) took 38978.47 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 955.5 MB in the beginning and 822.4 MB in the end (delta: 133.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-11-18 14:27:41,953 INFO L168 Benchmark]: CDTParser took 0.17 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 14:27:41,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.21 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 920.6 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-18 14:27:41,954 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 920.6 MB in the beginning and 1.1 GB in the end (delta: -197.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-18 14:27:41,954 INFO L168 Benchmark]: Boogie Preprocessor took 51.23 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 14:27:41,954 INFO L168 Benchmark]: RCFGBuilder took 899.17 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.3 MB). Peak memory consumption was 103.3 MB. Max. memory is 11.5 GB. [2018-11-18 14:27:41,954 INFO L168 Benchmark]: TraceAbstraction took 37460.74 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 860.5 MB in the end (delta: 148.6 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-11-18 14:27:41,955 INFO L168 Benchmark]: Witness Printer took 114.78 ms. Allocated memory is still 2.9 GB. Free memory was 860.5 MB in the beginning and 822.4 MB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2018-11-18 14:27:41,956 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.17 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 370.21 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 920.6 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 920.6 MB in the beginning and 1.1 GB in the end (delta: -197.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.23 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 899.17 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.3 MB). Peak memory consumption was 103.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37460.74 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 860.5 MB in the end (delta: 148.6 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 114.78 ms. Allocated memory is still 2.9 GB. Free memory was 860.5 MB in the beginning and 822.4 MB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 392]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; VAL [\old(a)=31, \old(a12)=27, \old(a16)=24, \old(a17)=18, \old(a20)=19, \old(a21)=23, \old(a7)=26, \old(a8)=34, \old(b)=20, \old(c)=21, \old(d)=29, \old(e)=17, \old(f)=28, \old(u)=32, \old(v)=16, \old(w)=30, \old(x)=22, \old(y)=33, \old(z)=25, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L580] int output = -1; VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] RET return 21; VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=3, \result=21, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, calculate_output(input)=21, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] RET return 21; VAL [\old(a16)=4, \old(a17)=0, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, \result=21, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, calculate_output(input)=21, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] RET return 26; VAL [\old(a16)=6, \old(a17)=1, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=4, \result=26, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=4, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=1, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] RET return 26; VAL [\old(a16)=6, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=15, \old(input)=1, \result=26, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=1, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND TRUE ((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5)) [L262] a16 = 4 [L263] a20 = 0 [L264] RET return 25; VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, \result=25, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, calculate_output(input)=25, d=4, e=5, f=6, input=6, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, output=25, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL, EXPR calculate_output(input) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND TRUE ((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1))))))))) [L239] a20 = 0 [L240] a21 = 1 [L241] a17 = 0 [L242] a8 = 14 [L243] a16 = 4 [L244] RET return -1; VAL [\old(a16)=4, \old(a17)=1, \old(a20)=0, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=6, \result=-1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=6, output=25, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=1, \old(a7)=0, \old(a8)=15, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L591] CALL calculate_output(input) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L391] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L392] __VERIFIER_error() VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=1, \old(a8)=14, \old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. UNSAFE Result, 37.4s OverallTime, 17 OverallIterations, 7 TraceHistogramMax, 28.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2221 SDtfs, 16685 SDslu, 3488 SDs, 0 SdLazy, 23648 SolverSat, 3798 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 3831 GetRequests, 3514 SyntacticMatches, 11 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3806 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16098occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.0s AbstIntTime, 11 AbstIntIterations, 5 AbstIntStrong, 0.9967645966628128 AbsIntWeakeningRatio, 0.2677514792899408 AbsIntAvgWeakeningVarsNumRemoved, 27.00887573964497 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 3382 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 4224 NumberOfCodeBlocks, 4224 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 5255 ConstructedInterpolants, 0 QuantifiedInterpolants, 3812462 SizeOfPredicates, 17 NumberOfNonLiveVariables, 3873 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 5849/6403 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...