./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label56_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_d39a2ee4-9567-4b0b-aa42-43765cf995e9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d39a2ee4-9567-4b0b-aa42-43765cf995e9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d39a2ee4-9567-4b0b-aa42-43765cf995e9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d39a2ee4-9567-4b0b-aa42-43765cf995e9/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label56_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d39a2ee4-9567-4b0b-aa42-43765cf995e9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d39a2ee4-9567-4b0b-aa42-43765cf995e9/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 08b7aa26e03024d3f4d1247f9fe7868985d0c8c2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:15:09,580 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:15:09,581 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:15:09,589 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:15:09,590 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:15:09,590 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:15:09,591 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:15:09,592 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:15:09,593 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:15:09,594 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:15:09,594 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:15:09,595 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:15:09,595 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:15:09,596 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:15:09,596 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:15:09,597 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:15:09,597 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:15:09,598 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:15:09,599 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:15:09,600 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:15:09,601 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:15:09,602 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:15:09,603 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:15:09,604 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:15:09,604 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:15:09,604 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:15:09,605 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:15:09,605 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:15:09,606 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:15:09,606 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:15:09,607 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:15:09,607 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:15:09,607 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:15:09,607 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:15:09,608 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:15:09,609 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:15:09,609 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d39a2ee4-9567-4b0b-aa42-43765cf995e9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 09:15:09,617 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:15:09,617 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:15:09,618 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 09:15:09,618 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 09:15:09,618 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 09:15:09,618 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 09:15:09,618 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 09:15:09,618 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 09:15:09,618 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 09:15:09,619 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 09:15:09,619 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 09:15:09,619 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 09:15:09,619 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 09:15:09,619 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:15:09,620 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:15:09,620 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:15:09,620 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:15:09,620 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:15:09,620 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 09:15:09,620 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:15:09,620 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 09:15:09,621 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:15:09,621 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:15:09,621 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:15:09,621 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 09:15:09,621 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:15:09,621 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:15:09,621 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:15:09,621 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 09:15:09,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:15:09,622 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:15:09,622 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:15:09,622 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 09:15:09,622 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 09:15:09,622 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:15:09,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 09:15:09,623 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 09:15:09,623 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_d39a2ee4-9567-4b0b-aa42-43765cf995e9/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 -> 08b7aa26e03024d3f4d1247f9fe7868985d0c8c2 [2018-11-18 09:15:09,646 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:15:09,656 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:15:09,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:15:09,659 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:15:09,659 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:15:09,660 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d39a2ee4-9567-4b0b-aa42-43765cf995e9/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label56_false-unreach-call_false-termination.c [2018-11-18 09:15:09,704 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d39a2ee4-9567-4b0b-aa42-43765cf995e9/bin-2019/utaipan/data/bfeab324c/1710ed7f9c294c6da11db55e2f5757c2/FLAG061ae1979 [2018-11-18 09:15:10,155 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:15:10,156 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d39a2ee4-9567-4b0b-aa42-43765cf995e9/sv-benchmarks/c/eca-rers2012/Problem01_label56_false-unreach-call_false-termination.c [2018-11-18 09:15:10,165 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d39a2ee4-9567-4b0b-aa42-43765cf995e9/bin-2019/utaipan/data/bfeab324c/1710ed7f9c294c6da11db55e2f5757c2/FLAG061ae1979 [2018-11-18 09:15:10,177 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d39a2ee4-9567-4b0b-aa42-43765cf995e9/bin-2019/utaipan/data/bfeab324c/1710ed7f9c294c6da11db55e2f5757c2 [2018-11-18 09:15:10,179 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:15:10,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:15:10,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:15:10,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:15:10,182 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:15:10,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:15:10" (1/1) ... [2018-11-18 09:15:10,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3275144b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:10, skipping insertion in model container [2018-11-18 09:15:10,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:15:10" (1/1) ... [2018-11-18 09:15:10,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:15:10,228 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:15:10,443 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:15:10,446 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:15:10,510 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:15:10,522 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:15:10,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:10 WrapperNode [2018-11-18 09:15:10,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:15:10,524 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:15:10,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:15:10,524 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:15:10,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:10" (1/1) ... [2018-11-18 09:15:10,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:10" (1/1) ... [2018-11-18 09:15:10,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:15:10,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:15:10,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:15:10,598 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:15:10,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:10" (1/1) ... [2018-11-18 09:15:10,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:10" (1/1) ... [2018-11-18 09:15:10,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:10" (1/1) ... [2018-11-18 09:15:10,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:10" (1/1) ... [2018-11-18 09:15:10,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:10" (1/1) ... [2018-11-18 09:15:10,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:10" (1/1) ... [2018-11-18 09:15:10,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:10" (1/1) ... [2018-11-18 09:15:10,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:15:10,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:15:10,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:15:10,648 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:15:10,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d39a2ee4-9567-4b0b-aa42-43765cf995e9/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 09:15:10,694 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 09:15:10,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 09:15:10,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 09:15:10,695 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-18 09:15:10,695 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-18 09:15:10,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:15:10,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:15:10,695 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 09:15:10,695 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 09:15:11,425 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:15:11,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:15:11 BoogieIcfgContainer [2018-11-18 09:15:11,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:15:11,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 09:15:11,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 09:15:11,429 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 09:15:11,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:15:10" (1/3) ... [2018-11-18 09:15:11,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb2e97c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:15:11, skipping insertion in model container [2018-11-18 09:15:11,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:15:10" (2/3) ... [2018-11-18 09:15:11,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb2e97c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:15:11, skipping insertion in model container [2018-11-18 09:15:11,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:15:11" (3/3) ... [2018-11-18 09:15:11,431 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label56_false-unreach-call_false-termination.c [2018-11-18 09:15:11,437 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 09:15:11,442 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 09:15:11,451 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 09:15:11,472 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 09:15:11,472 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 09:15:11,472 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 09:15:11,472 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:15:11,472 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:15:11,473 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 09:15:11,473 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:15:11,473 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 09:15:11,489 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-18 09:15:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 09:15:11,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:15:11,495 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, 1, 1, 1, 1] [2018-11-18 09:15:11,496 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:15:11,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:11,500 INFO L82 PathProgramCache]: Analyzing trace with hash 87067645, now seen corresponding path program 1 times [2018-11-18 09:15:11,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:15:11,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:11,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:11,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:11,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:15:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:11,757 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 09:15:11,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:15:11,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:15:11,759 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:15:11,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:15:11,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:15:11,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:15:11,773 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-18 09:15:12,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:15:12,402 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-18 09:15:12,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:15:12,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-11-18 09:15:12,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:15:12,412 INFO L225 Difference]: With dead ends: 550 [2018-11-18 09:15:12,412 INFO L226 Difference]: Without dead ends: 340 [2018-11-18 09:15:12,415 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 09:15:12,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-18 09:15:12,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-18 09:15:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-18 09:15:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 571 transitions. [2018-11-18 09:15:12,457 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 571 transitions. Word has length 83 [2018-11-18 09:15:12,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:15:12,458 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 571 transitions. [2018-11-18 09:15:12,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:15:12,459 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 571 transitions. [2018-11-18 09:15:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 09:15:12,462 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:15:12,463 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:15:12,466 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:15:12,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:12,466 INFO L82 PathProgramCache]: Analyzing trace with hash 236043766, now seen corresponding path program 1 times [2018-11-18 09:15:12,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:15:12,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:12,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:12,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:12,468 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:15:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:12,586 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 09:15:12,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:15:12,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:15:12,587 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:15:12,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:15:12,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:15:12,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:15:12,589 INFO L87 Difference]: Start difference. First operand 340 states and 571 transitions. Second operand 3 states. [2018-11-18 09:15:12,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:15:12,971 INFO L93 Difference]: Finished difference Result 946 states and 1654 transitions. [2018-11-18 09:15:12,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:15:12,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-11-18 09:15:12,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:15:12,975 INFO L225 Difference]: With dead ends: 946 [2018-11-18 09:15:12,975 INFO L226 Difference]: Without dead ends: 612 [2018-11-18 09:15:12,978 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 09:15:12,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-11-18 09:15:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2018-11-18 09:15:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-11-18 09:15:13,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 987 transitions. [2018-11-18 09:15:13,000 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 987 transitions. Word has length 101 [2018-11-18 09:15:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:15:13,001 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 987 transitions. [2018-11-18 09:15:13,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:15:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 987 transitions. [2018-11-18 09:15:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 09:15:13,005 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:15:13,005 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:15:13,005 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:15:13,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:13,006 INFO L82 PathProgramCache]: Analyzing trace with hash 956519722, now seen corresponding path program 1 times [2018-11-18 09:15:13,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:15:13,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:13,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:13,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:13,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:15:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:13,147 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:15:13,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:15:13,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 09:15:13,147 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:15:13,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 09:15:13,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:15:13,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:15:13,148 INFO L87 Difference]: Start difference. First operand 612 states and 987 transitions. Second operand 6 states. [2018-11-18 09:15:13,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:15:13,777 INFO L93 Difference]: Finished difference Result 1625 states and 2647 transitions. [2018-11-18 09:15:13,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 09:15:13,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-18 09:15:13,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:15:13,784 INFO L225 Difference]: With dead ends: 1625 [2018-11-18 09:15:13,784 INFO L226 Difference]: Without dead ends: 1019 [2018-11-18 09:15:13,787 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 09:15:13,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2018-11-18 09:15:13,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1009. [2018-11-18 09:15:13,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2018-11-18 09:15:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1456 transitions. [2018-11-18 09:15:13,818 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1456 transitions. Word has length 127 [2018-11-18 09:15:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:15:13,822 INFO L480 AbstractCegarLoop]: Abstraction has 1009 states and 1456 transitions. [2018-11-18 09:15:13,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 09:15:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1456 transitions. [2018-11-18 09:15:13,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 09:15:13,825 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:15:13,825 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, 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] [2018-11-18 09:15:13,826 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:15:13,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:13,826 INFO L82 PathProgramCache]: Analyzing trace with hash 2140307095, now seen corresponding path program 1 times [2018-11-18 09:15:13,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:15:13,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:13,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:13,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:13,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:15:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:13,938 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 60 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:15:13,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:15:13,939 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:15:13,939 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 140 with the following transitions: [2018-11-18 09:15:13,941 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [17], [18], [22], [26], [30], [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], [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], [273], [281], [289], [297], [301], [303], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 09:15:13,974 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:15:13,974 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:15:14,480 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 09:15:14,502 INFO L272 AbstractInterpreter]: Visited 87 different actions 167 times. Merged at 4 different actions 4 times. Never widened. Performed 2520 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2520 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 09:15:14,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:14,518 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 09:15:14,758 INFO L227 lantSequenceWeakener]: Weakened 136 states. On average, predicates are now at 81.26% of their original sizes. [2018-11-18 09:15:14,759 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 09:15:14,828 INFO L415 sIntCurrentIteration]: We unified 138 AI predicates to 138 [2018-11-18 09:15:14,828 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 09:15:14,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:15:14,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-18 09:15:14,829 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:15:14,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 09:15:14,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 09:15:14,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:15:14,830 INFO L87 Difference]: Start difference. First operand 1009 states and 1456 transitions. Second operand 10 states. [2018-11-18 09:15:19,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:15:19,585 INFO L93 Difference]: Finished difference Result 3127 states and 4449 transitions. [2018-11-18 09:15:19,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 09:15:19,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 139 [2018-11-18 09:15:19,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:15:19,593 INFO L225 Difference]: With dead ends: 3127 [2018-11-18 09:15:19,593 INFO L226 Difference]: Without dead ends: 2124 [2018-11-18 09:15:19,597 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 148 GetRequests, 130 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 09:15:19,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2018-11-18 09:15:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 2090. [2018-11-18 09:15:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2018-11-18 09:15:19,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 2657 transitions. [2018-11-18 09:15:19,642 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 2657 transitions. Word has length 139 [2018-11-18 09:15:19,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:15:19,643 INFO L480 AbstractCegarLoop]: Abstraction has 2090 states and 2657 transitions. [2018-11-18 09:15:19,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 09:15:19,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2657 transitions. [2018-11-18 09:15:19,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-18 09:15:19,647 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:15:19,647 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-18 09:15:19,648 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:15:19,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:19,648 INFO L82 PathProgramCache]: Analyzing trace with hash -270523044, now seen corresponding path program 1 times [2018-11-18 09:15:19,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:15:19,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:19,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:19,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:19,649 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:15:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 09:15:19,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:15:19,770 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:15:19,770 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 153 with the following transitions: [2018-11-18 09:15:19,771 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], [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], [273], [281], [289], [297], [301], [303], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 09:15:19,774 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:15:19,774 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:15:19,876 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 09:15:19,877 INFO L272 AbstractInterpreter]: Visited 88 different actions 170 times. Merged at 5 different actions 5 times. Never widened. Performed 2424 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2424 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 09:15:19,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:19,878 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 09:15:20,057 INFO L227 lantSequenceWeakener]: Weakened 149 states. On average, predicates are now at 81.27% of their original sizes. [2018-11-18 09:15:20,057 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 09:15:20,139 INFO L415 sIntCurrentIteration]: We unified 151 AI predicates to 151 [2018-11-18 09:15:20,139 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 09:15:20,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:15:20,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-18 09:15:20,140 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:15:20,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 09:15:20,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 09:15:20,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:15:20,140 INFO L87 Difference]: Start difference. First operand 2090 states and 2657 transitions. Second operand 10 states. [2018-11-18 09:15:22,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:15:22,934 INFO L93 Difference]: Finished difference Result 4179 states and 5377 transitions. [2018-11-18 09:15:22,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 09:15:22,935 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 152 [2018-11-18 09:15:22,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:15:22,940 INFO L225 Difference]: With dead ends: 4179 [2018-11-18 09:15:22,940 INFO L226 Difference]: Without dead ends: 2231 [2018-11-18 09:15:22,943 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 159 GetRequests, 143 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 09:15:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2018-11-18 09:15:22,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2228. [2018-11-18 09:15:22,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2228 states. [2018-11-18 09:15:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2810 transitions. [2018-11-18 09:15:22,973 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2810 transitions. Word has length 152 [2018-11-18 09:15:22,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:15:22,973 INFO L480 AbstractCegarLoop]: Abstraction has 2228 states and 2810 transitions. [2018-11-18 09:15:22,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 09:15:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2810 transitions. [2018-11-18 09:15:22,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-18 09:15:22,976 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:15:22,976 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:15:22,976 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:15:22,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:22,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1879670927, now seen corresponding path program 1 times [2018-11-18 09:15:22,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:15:22,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:22,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:22,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:22,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:15:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 86 proven. 14 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-18 09:15:23,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:15:23,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:15:23,045 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2018-11-18 09:15:23,045 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [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], [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], [273], [281], [289], [297], [301], [303], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 09:15:23,049 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:15:23,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:15:23,185 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 09:15:23,185 INFO L272 AbstractInterpreter]: Visited 89 different actions 264 times. Merged at 7 different actions 19 times. Never widened. Performed 3879 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3879 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-18 09:15:23,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:23,194 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 09:15:23,376 INFO L227 lantSequenceWeakener]: Weakened 161 states. On average, predicates are now at 83.06% of their original sizes. [2018-11-18 09:15:23,376 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 09:15:23,405 INFO L415 sIntCurrentIteration]: We unified 163 AI predicates to 163 [2018-11-18 09:15:23,405 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 09:15:23,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:15:23,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-18 09:15:23,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:15:23,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 09:15:23,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 09:15:23,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 09:15:23,406 INFO L87 Difference]: Start difference. First operand 2228 states and 2810 transitions. Second operand 9 states. [2018-11-18 09:15:25,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:15:25,745 INFO L93 Difference]: Finished difference Result 5055 states and 6615 transitions. [2018-11-18 09:15:25,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 09:15:25,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2018-11-18 09:15:25,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:15:25,754 INFO L225 Difference]: With dead ends: 5055 [2018-11-18 09:15:25,754 INFO L226 Difference]: Without dead ends: 3107 [2018-11-18 09:15:25,759 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 170 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-11-18 09:15:25,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2018-11-18 09:15:25,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 3063. [2018-11-18 09:15:25,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3063 states. [2018-11-18 09:15:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 3840 transitions. [2018-11-18 09:15:25,814 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 3840 transitions. Word has length 164 [2018-11-18 09:15:25,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:15:25,815 INFO L480 AbstractCegarLoop]: Abstraction has 3063 states and 3840 transitions. [2018-11-18 09:15:25,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 09:15:25,815 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 3840 transitions. [2018-11-18 09:15:25,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 09:15:25,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:15:25,820 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:15:25,820 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:15:25,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:25,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1577382144, now seen corresponding path program 1 times [2018-11-18 09:15:25,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:15:25,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:25,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:25,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:25,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:15:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 102 proven. 20 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-18 09:15:25,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:15:25,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:15:25,876 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 179 with the following transitions: [2018-11-18 09:15:25,877 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [25], [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], [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], [273], [281], [289], [297], [301], [303], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 09:15:25,879 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:15:25,880 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:15:26,173 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:15:26,173 INFO L272 AbstractInterpreter]: Visited 91 different actions 455 times. Merged at 9 different actions 47 times. Widened at 1 different actions 1 times. Performed 7019 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7019 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 12 fixpoints after 4 different actions. Largest state had 42 variables. [2018-11-18 09:15:26,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:26,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:15:26,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:15:26,179 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d39a2ee4-9567-4b0b-aa42-43765cf995e9/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 09:15:26,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:26,185 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:15:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:26,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:15:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 82 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-18 09:15:26,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:15:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 102 proven. 20 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-18 09:15:26,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 09:15:26,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-11-18 09:15:26,457 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 09:15:26,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 09:15:26,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 09:15:26,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-18 09:15:26,458 INFO L87 Difference]: Start difference. First operand 3063 states and 3840 transitions. Second operand 8 states. [2018-11-18 09:15:28,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:15:28,168 INFO L93 Difference]: Finished difference Result 10375 states and 13878 transitions. [2018-11-18 09:15:28,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 09:15:28,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2018-11-18 09:15:28,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:15:28,181 INFO L225 Difference]: With dead ends: 10375 [2018-11-18 09:15:28,182 INFO L226 Difference]: Without dead ends: 4398 [2018-11-18 09:15:28,201 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-11-18 09:15:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4398 states. [2018-11-18 09:15:28,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4398 to 4282. [2018-11-18 09:15:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4282 states. [2018-11-18 09:15:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4282 states to 4282 states and 4993 transitions. [2018-11-18 09:15:28,310 INFO L78 Accepts]: Start accepts. Automaton has 4282 states and 4993 transitions. Word has length 178 [2018-11-18 09:15:28,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:15:28,311 INFO L480 AbstractCegarLoop]: Abstraction has 4282 states and 4993 transitions. [2018-11-18 09:15:28,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 09:15:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4282 states and 4993 transitions. [2018-11-18 09:15:28,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-18 09:15:28,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:15:28,315 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 09:15:28,315 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:15:28,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:28,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1489431736, now seen corresponding path program 1 times [2018-11-18 09:15:28,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:15:28,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:28,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:28,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:28,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:15:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 112 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 09:15:28,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:15:28,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:15:28,401 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 186 with the following transitions: [2018-11-18 09:15:28,402 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], [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], [273], [281], [289], [297], [301], [303], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 09:15:28,404 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:15:28,404 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:15:28,482 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 09:15:28,482 INFO L272 AbstractInterpreter]: Visited 88 different actions 170 times. Merged at 5 different actions 5 times. Never widened. Performed 2485 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2485 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 09:15:28,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:28,490 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 09:15:28,619 INFO L227 lantSequenceWeakener]: Weakened 182 states. On average, predicates are now at 81.33% of their original sizes. [2018-11-18 09:15:28,619 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 09:15:28,671 INFO L415 sIntCurrentIteration]: We unified 184 AI predicates to 184 [2018-11-18 09:15:28,671 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 09:15:28,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:15:28,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-18 09:15:28,672 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:15:28,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 09:15:28,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 09:15:28,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:15:28,672 INFO L87 Difference]: Start difference. First operand 4282 states and 4993 transitions. Second operand 10 states. [2018-11-18 09:15:30,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:15:30,523 INFO L93 Difference]: Finished difference Result 8745 states and 10208 transitions. [2018-11-18 09:15:30,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 09:15:30,523 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 185 [2018-11-18 09:15:30,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:15:30,537 INFO L225 Difference]: With dead ends: 8745 [2018-11-18 09:15:30,537 INFO L226 Difference]: Without dead ends: 4743 [2018-11-18 09:15:30,546 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 193 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-18 09:15:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4743 states. [2018-11-18 09:15:30,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4743 to 4740. [2018-11-18 09:15:30,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4740 states. [2018-11-18 09:15:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4740 states to 4740 states and 5482 transitions. [2018-11-18 09:15:30,644 INFO L78 Accepts]: Start accepts. Automaton has 4740 states and 5482 transitions. Word has length 185 [2018-11-18 09:15:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:15:30,645 INFO L480 AbstractCegarLoop]: Abstraction has 4740 states and 5482 transitions. [2018-11-18 09:15:30,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 09:15:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 4740 states and 5482 transitions. [2018-11-18 09:15:30,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-18 09:15:30,653 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:15:30,654 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:15:30,654 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:15:30,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:30,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1429384251, now seen corresponding path program 1 times [2018-11-18 09:15:30,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:15:30,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:30,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:30,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:30,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:15:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:30,840 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 110 proven. 62 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 09:15:30,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:15:30,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:15:30,841 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2018-11-18 09:15:30,841 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], [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], [273], [281], [289], [297], [301], [303], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 09:15:30,843 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:15:30,844 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:15:31,052 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:15:31,052 INFO L272 AbstractInterpreter]: Visited 90 different actions 360 times. Merged at 9 different actions 36 times. Never widened. Performed 5427 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5427 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 09:15:31,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:31,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:15:31,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:15:31,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d39a2ee4-9567-4b0b-aa42-43765cf995e9/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 09:15:31,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:31,069 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:15:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:31,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:15:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 126 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-18 09:15:31,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:15:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 116 proven. 54 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 09:15:31,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 09:15:31,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-18 09:15:31,248 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 09:15:31,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 09:15:31,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 09:15:31,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-18 09:15:31,249 INFO L87 Difference]: Start difference. First operand 4740 states and 5482 transitions. Second operand 11 states. [2018-11-18 09:15:32,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:15:32,010 INFO L93 Difference]: Finished difference Result 9818 states and 11506 transitions. [2018-11-18 09:15:32,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 09:15:32,011 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 194 [2018-11-18 09:15:32,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:15:32,020 INFO L225 Difference]: With dead ends: 9818 [2018-11-18 09:15:32,020 INFO L226 Difference]: Without dead ends: 5678 [2018-11-18 09:15:32,026 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 389 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-11-18 09:15:32,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5678 states. [2018-11-18 09:15:32,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5678 to 5657. [2018-11-18 09:15:32,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5657 states. [2018-11-18 09:15:32,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5657 states to 5657 states and 6469 transitions. [2018-11-18 09:15:32,085 INFO L78 Accepts]: Start accepts. Automaton has 5657 states and 6469 transitions. Word has length 194 [2018-11-18 09:15:32,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:15:32,085 INFO L480 AbstractCegarLoop]: Abstraction has 5657 states and 6469 transitions. [2018-11-18 09:15:32,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 09:15:32,086 INFO L276 IsEmpty]: Start isEmpty. Operand 5657 states and 6469 transitions. [2018-11-18 09:15:32,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-18 09:15:32,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:15:32,091 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:15:32,091 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:15:32,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:32,092 INFO L82 PathProgramCache]: Analyzing trace with hash 488326995, now seen corresponding path program 1 times [2018-11-18 09:15:32,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:15:32,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:32,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:32,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:32,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:15:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 132 proven. 65 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 09:15:32,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:15:32,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:15:32,196 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-11-18 09:15:32,197 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], [145], [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], [273], [281], [289], [297], [301], [303], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 09:15:32,198 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:15:32,198 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:15:32,309 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 09:15:32,309 INFO L272 AbstractInterpreter]: Visited 89 different actions 259 times. Merged at 7 different actions 14 times. Never widened. Performed 3679 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3679 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 09:15:32,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:32,310 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 09:15:32,472 INFO L227 lantSequenceWeakener]: Weakened 200 states. On average, predicates are now at 83.13% of their original sizes. [2018-11-18 09:15:32,472 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 09:15:32,532 INFO L415 sIntCurrentIteration]: We unified 202 AI predicates to 202 [2018-11-18 09:15:32,532 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 09:15:32,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:15:32,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-18 09:15:32,532 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:15:32,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 09:15:32,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 09:15:32,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 09:15:32,533 INFO L87 Difference]: Start difference. First operand 5657 states and 6469 transitions. Second operand 9 states. [2018-11-18 09:15:34,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:15:34,005 INFO L93 Difference]: Finished difference Result 10999 states and 12657 transitions. [2018-11-18 09:15:34,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 09:15:34,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 203 [2018-11-18 09:15:34,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:15:34,016 INFO L225 Difference]: With dead ends: 10999 [2018-11-18 09:15:34,017 INFO L226 Difference]: Without dead ends: 6080 [2018-11-18 09:15:34,024 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 208 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-11-18 09:15:34,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6080 states. [2018-11-18 09:15:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6080 to 6073. [2018-11-18 09:15:34,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6073 states. [2018-11-18 09:15:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6073 states to 6073 states and 6925 transitions. [2018-11-18 09:15:34,085 INFO L78 Accepts]: Start accepts. Automaton has 6073 states and 6925 transitions. Word has length 203 [2018-11-18 09:15:34,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:15:34,086 INFO L480 AbstractCegarLoop]: Abstraction has 6073 states and 6925 transitions. [2018-11-18 09:15:34,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 09:15:34,086 INFO L276 IsEmpty]: Start isEmpty. Operand 6073 states and 6925 transitions. [2018-11-18 09:15:34,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-18 09:15:34,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:15:34,091 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 09:15:34,092 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:15:34,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:34,092 INFO L82 PathProgramCache]: Analyzing trace with hash 2117554756, now seen corresponding path program 1 times [2018-11-18 09:15:34,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:15:34,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:34,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:34,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:34,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:15:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 126 proven. 77 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-18 09:15:34,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:15:34,187 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:15:34,187 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 209 with the following transitions: [2018-11-18 09:15:34,188 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [25], [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], [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], [273], [281], [289], [297], [301], [303], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 09:15:34,189 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:15:34,190 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:15:34,368 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:15:34,369 INFO L272 AbstractInterpreter]: Visited 91 different actions 367 times. Merged at 10 different actions 39 times. Never widened. Performed 5478 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5478 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-18 09:15:34,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:34,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:15:34,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:15:34,382 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d39a2ee4-9567-4b0b-aa42-43765cf995e9/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 09:15:34,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:34,399 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:15:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:34,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:15:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 148 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-18 09:15:34,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:15:34,547 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 132 proven. 20 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-18 09:15:34,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 09:15:34,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-18 09:15:34,564 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 09:15:34,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 09:15:34,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 09:15:34,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-18 09:15:34,564 INFO L87 Difference]: Start difference. First operand 6073 states and 6925 transitions. Second operand 12 states. [2018-11-18 09:15:36,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:15:36,694 INFO L93 Difference]: Finished difference Result 15148 states and 18127 transitions. [2018-11-18 09:15:36,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-18 09:15:36,695 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 208 [2018-11-18 09:15:36,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:15:36,714 INFO L225 Difference]: With dead ends: 15148 [2018-11-18 09:15:36,714 INFO L226 Difference]: Without dead ends: 8996 [2018-11-18 09:15:36,725 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 446 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=468, Invalid=1788, Unknown=0, NotChecked=0, Total=2256 [2018-11-18 09:15:36,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8996 states. [2018-11-18 09:15:36,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8996 to 8799. [2018-11-18 09:15:36,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8799 states. [2018-11-18 09:15:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8799 states to 8799 states and 10302 transitions. [2018-11-18 09:15:36,895 INFO L78 Accepts]: Start accepts. Automaton has 8799 states and 10302 transitions. Word has length 208 [2018-11-18 09:15:36,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:15:36,895 INFO L480 AbstractCegarLoop]: Abstraction has 8799 states and 10302 transitions. [2018-11-18 09:15:36,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 09:15:36,895 INFO L276 IsEmpty]: Start isEmpty. Operand 8799 states and 10302 transitions. [2018-11-18 09:15:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-18 09:15:36,905 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:15:36,905 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, 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, 1, 1] [2018-11-18 09:15:36,905 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:15:36,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:36,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1996971937, now seen corresponding path program 1 times [2018-11-18 09:15:36,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:15:36,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:36,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:36,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:36,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:15:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:37,032 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 187 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 09:15:37,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:15:37,032 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:15:37,032 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-11-18 09:15:37,033 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], [105], [106], [110], [114], [118], [122], [126], [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], [273], [281], [289], [297], [301], [303], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 09:15:37,034 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:15:37,034 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:15:37,211 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:15:37,211 INFO L272 AbstractInterpreter]: Visited 90 different actions 358 times. Merged at 9 different actions 34 times. Widened at 1 different actions 1 times. Performed 5531 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5531 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-18 09:15:37,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:37,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:15:37,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:15:37,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d39a2ee4-9567-4b0b-aa42-43765cf995e9/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 09:15:37,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:37,218 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:15:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:37,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:15:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 207 proven. 2 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-18 09:15:37,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:15:37,609 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 167 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-18 09:15:37,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 09:15:37,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-18 09:15:37,634 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 09:15:37,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 09:15:37,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 09:15:37,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-18 09:15:37,635 INFO L87 Difference]: Start difference. First operand 8799 states and 10302 transitions. Second operand 12 states. [2018-11-18 09:15:39,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:15:39,648 INFO L93 Difference]: Finished difference Result 20660 states and 26395 transitions. [2018-11-18 09:15:39,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-18 09:15:39,648 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 219 [2018-11-18 09:15:39,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:15:39,685 INFO L225 Difference]: With dead ends: 20660 [2018-11-18 09:15:39,685 INFO L226 Difference]: Without dead ends: 10414 [2018-11-18 09:15:39,715 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 457 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=443, Invalid=1537, Unknown=0, NotChecked=0, Total=1980 [2018-11-18 09:15:39,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10414 states. [2018-11-18 09:15:39,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10414 to 9522. [2018-11-18 09:15:39,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9522 states. [2018-11-18 09:15:39,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9522 states to 9522 states and 10913 transitions. [2018-11-18 09:15:39,898 INFO L78 Accepts]: Start accepts. Automaton has 9522 states and 10913 transitions. Word has length 219 [2018-11-18 09:15:39,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:15:39,899 INFO L480 AbstractCegarLoop]: Abstraction has 9522 states and 10913 transitions. [2018-11-18 09:15:39,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 09:15:39,899 INFO L276 IsEmpty]: Start isEmpty. Operand 9522 states and 10913 transitions. [2018-11-18 09:15:39,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-11-18 09:15:39,911 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:15:39,911 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1] [2018-11-18 09:15:39,911 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:15:39,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:39,912 INFO L82 PathProgramCache]: Analyzing trace with hash 887393386, now seen corresponding path program 1 times [2018-11-18 09:15:39,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:15:39,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:39,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:39,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:39,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:15:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:40,156 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 248 proven. 87 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-18 09:15:40,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:15:40,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:15:40,157 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 246 with the following transitions: [2018-11-18 09:15:40,157 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [49], [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], [273], [281], [289], [297], [301], [303], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 09:15:40,159 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:15:40,159 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:15:40,414 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:15:40,414 INFO L272 AbstractInterpreter]: Visited 91 different actions 367 times. Merged at 10 different actions 39 times. Widened at 1 different actions 1 times. Performed 5722 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5722 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 4 different actions. Largest state had 42 variables. [2018-11-18 09:15:40,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:40,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:15:40,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:15:40,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d39a2ee4-9567-4b0b-aa42-43765cf995e9/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 09:15:40,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:40,446 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:15:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:40,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:15:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 275 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-18 09:15:40,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:15:40,708 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 214 proven. 15 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-18 09:15:40,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 09:15:40,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-18 09:15:40,724 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 09:15:40,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 09:15:40,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 09:15:40,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-18 09:15:40,725 INFO L87 Difference]: Start difference. First operand 9522 states and 10913 transitions. Second operand 12 states. [2018-11-18 09:15:41,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:15:41,859 INFO L93 Difference]: Finished difference Result 14971 states and 16955 transitions. [2018-11-18 09:15:41,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 09:15:41,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 245 [2018-11-18 09:15:41,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:15:41,873 INFO L225 Difference]: With dead ends: 14971 [2018-11-18 09:15:41,873 INFO L226 Difference]: Without dead ends: 7609 [2018-11-18 09:15:41,885 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=251, Invalid=871, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 09:15:41,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7609 states. [2018-11-18 09:15:41,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7609 to 5813. [2018-11-18 09:15:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5813 states. [2018-11-18 09:15:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5813 states to 5813 states and 6360 transitions. [2018-11-18 09:15:41,987 INFO L78 Accepts]: Start accepts. Automaton has 5813 states and 6360 transitions. Word has length 245 [2018-11-18 09:15:41,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:15:41,987 INFO L480 AbstractCegarLoop]: Abstraction has 5813 states and 6360 transitions. [2018-11-18 09:15:41,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 09:15:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 5813 states and 6360 transitions. [2018-11-18 09:15:41,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-18 09:15:41,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:15:41,995 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 09:15:41,995 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:15:41,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:41,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1935731237, now seen corresponding path program 1 times [2018-11-18 09:15:41,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:15:41,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:41,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:41,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:41,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:15:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 225 proven. 24 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-11-18 09:15:42,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:15:42,097 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:15:42,097 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 251 with the following transitions: [2018-11-18 09:15:42,098 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [33], [34], [37], [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], [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], [273], [281], [289], [297], [301], [303], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-18 09:15:42,101 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:15:42,102 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:15:42,319 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:15:42,319 INFO L272 AbstractInterpreter]: Visited 92 different actions 368 times. Merged at 11 different actions 36 times. Never widened. Performed 5634 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5634 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 11 fixpoints after 5 different actions. Largest state had 42 variables. [2018-11-18 09:15:42,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:42,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:15:42,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:15:42,322 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d39a2ee4-9567-4b0b-aa42-43765cf995e9/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 09:15:42,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:42,331 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:15:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:15:42,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:15:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 308 proven. 2 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-11-18 09:15:42,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:15:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 225 proven. 24 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-11-18 09:15:42,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 09:15:42,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-18 09:15:42,503 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 09:15:42,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 09:15:42,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 09:15:42,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-18 09:15:42,504 INFO L87 Difference]: Start difference. First operand 5813 states and 6360 transitions. Second operand 9 states. [2018-11-18 09:15:43,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:15:43,094 INFO L93 Difference]: Finished difference Result 12409 states and 13716 transitions. [2018-11-18 09:15:43,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 09:15:43,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 250 [2018-11-18 09:15:43,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:15:43,103 INFO L225 Difference]: With dead ends: 12409 [2018-11-18 09:15:43,103 INFO L226 Difference]: Without dead ends: 7218 [2018-11-18 09:15:43,109 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 499 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-11-18 09:15:43,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7218 states. [2018-11-18 09:15:43,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7218 to 4454. [2018-11-18 09:15:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2018-11-18 09:15:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4790 transitions. [2018-11-18 09:15:43,170 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4790 transitions. Word has length 250 [2018-11-18 09:15:43,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:15:43,171 INFO L480 AbstractCegarLoop]: Abstraction has 4454 states and 4790 transitions. [2018-11-18 09:15:43,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 09:15:43,171 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4790 transitions. [2018-11-18 09:15:43,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-11-18 09:15:43,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:15:43,175 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 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, 1, 1, 1] [2018-11-18 09:15:43,175 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:15:43,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:15:43,175 INFO L82 PathProgramCache]: Analyzing trace with hash -2138236254, now seen corresponding path program 1 times [2018-11-18 09:15:43,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:15:43,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:43,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:15:43,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:15:43,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:15:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:15:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:15:43,267 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 09:15:43,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:15:43 BoogieIcfgContainer [2018-11-18 09:15:43,355 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 09:15:43,356 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:15:43,356 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:15:43,356 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:15:43,356 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:15:11" (3/4) ... [2018-11-18 09:15:43,358 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 09:15:43,455 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d39a2ee4-9567-4b0b-aa42-43765cf995e9/bin-2019/utaipan/witness.graphml [2018-11-18 09:15:43,455 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:15:43,455 INFO L168 Benchmark]: Toolchain (without parser) took 33276.50 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -149.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-11-18 09:15:43,456 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:15:43,457 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.30 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 913.4 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:15:43,457 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 913.4 MB in the beginning and 1.1 GB in the end (delta: -232.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:15:43,457 INFO L168 Benchmark]: Boogie Preprocessor took 50.19 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 09:15:43,457 INFO L168 Benchmark]: RCFGBuilder took 778.24 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: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:15:43,457 INFO L168 Benchmark]: TraceAbstraction took 31928.85 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -110.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-11-18 09:15:43,458 INFO L168 Benchmark]: Witness Printer took 99.22 ms. Allocated memory is still 3.0 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:15:43,459 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.30 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 913.4 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 913.4 MB in the beginning and 1.1 GB in the end (delta: -232.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.19 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 778.24 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: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31928.85 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -110.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 99.22 ms. Allocated memory is still 3.0 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 404]: 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=2, 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)=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, 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)=2, 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=2, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND TRUE ((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1))) [L224] a21 = 1 [L225] a8 = 14 [L226] a16 = 4 [L227] a20 = 0 [L228] a7 = 0 [L229] a17 = 0 [L230] RET return -1; VAL [\old(a16)=5, \old(a17)=1, \old(a20)=1, \old(a21)=0, \old(a7)=1, \old(a8)=13, \old(input)=2, \result=-1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=2, 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=0, a8=14, b=2, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=2, 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=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, 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 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L391] COND FALSE !(((((((!(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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((((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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L403] 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)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L404] __VERIFIER_error() VAL [\old(a16)=4, \old(a17)=0, \old(a20)=0, \old(a21)=1, \old(a7)=0, \old(a8)=14, \old(input)=4, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, input=4, 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, 31.8s OverallTime, 15 OverallIterations, 7 TraceHistogramMax, 23.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1639 SDtfs, 16688 SDslu, 3440 SDs, 0 SdLazy, 21890 SolverSat, 3488 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 3751 GetRequests, 3476 SyntacticMatches, 8 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1753 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9522occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.4s AbstIntTime, 11 AbstIntIterations, 5 AbstIntStrong, 0.9963827401634358 AbsIntWeakeningRatio, 0.25178997613365156 AbsIntAvgWeakeningVarsNumRemoved, 27.71599045346062 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 5887 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 4015 NumberOfCodeBlocks, 4015 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 5010 ConstructedInterpolants, 0 QuantifiedInterpolants, 1909117 SizeOfPredicates, 14 NumberOfNonLiveVariables, 3911 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 26 InterpolantComputations, 3 PerfectInterpolantSequences, 5461/6057 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...